default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 35
Volume 35, June 2006
- Dean G. Hoffman, Matt Walsh:
Bipartite graphs with even spanning trees. 3-6 - Jun-Ming Xu, Meijie Ma, Zheng-Zhong Du:
Edge-fault-tolerant properties of hypercubes and folded hypercubes. 7-16 - Doost Ali Mojdeh, Nader Jafari Rad, Abdollah Khodkar:
The defining numbers for vertex colorings of certain graphs. 17-30 - Joanna A. Ellis-Monaghan, David A. Pike, Yubo Zou:
Decycling of Fibonacci cubes. 31-40 - A. Aberkane, Václav Linek, Shai J. Mor:
On the powers in the Thue-Morse word. 41-50 - Alan F. Beardon:
The average degree in a vertex-magic graph. 51-56 - Masaaki Harada, Hadi Kharaghani:
Orthogonal designs and MDS self-dual codes. 57-68 - Ebadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng:
On the defining sets of some special graphs. 69-82 - Kenneth Finlayson, Moon Ho Lee, Jennifer Seberry, Mieko Yamada:
Jacket matrices constructed from Hadamard matrices and generalized Hadamard matrices. 83-88 - Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni:
Adjacent vertex distinguishing edge-colorings of meshes. 89-102 - Xuebin Zhang:
Construction for an OGDD of type 244. 103-112 - Peter Adams, Darryn E. Bryant:
Two-factorisations of complete graphs of orders fifteen and seventeen. 113-118 - Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
On (minimal) regular graphs of girth 6. 119-132 - Beate Küpper, Lutz Volkmann:
Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree. 133-140 - Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Total k-subdominating functions on graphs. 141-154 - Narong Punnim:
Decycling connected regular graphs. 155-170 - Xiyang Li, Qing Shu, Dianhua Wu:
Generalized Steiner systems GS5(2, 5, v, 5). 171-180 - Alberto M. Teguia, Anant P. Godbole:
Sierpiński gasket graphs and some of their properties. 181-192 - Diana Combe, Adrian M. Nelson:
Magic labellings of infinite graphs over infinite groups. 193-210 - Wenjie He, Yufa Shen, Yongqiang Zhao, Yanning Wang, Xinmiao Ma:
On property M(3) of some complete multipartite graphs. 211-220 - David E. Brown, J. Richard Lundgren:
Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs. 221-236 - Shinya Fujita, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions and vertex-disjoint cycles in a graph. 237-252 - Martin Baca, Muthali Murugan:
Super edge-antimagic labeling of a cycle with a chord. 253-262 - Jason Cousineau, Ilias S. Kotsireas, Christos Koukouvinos:
Genetic algorithms for orthogonal designs. 263-272 - Dorota Bród, Zdzislaw Skupien:
Trees with extremal numbers of dominating sets. 273-290 - Anna Lladó, Francesc A. Muntaner-Batle:
Any tree is a large subgraph of a magic tree. 291-298 - Matthew E. Gaston, Miro Kraetzl, Walter D. Wallis:
Using graph diameter for change detection in dynamic networks. 299-312 - Akira Saito:
Contractible edges and removable edges in a graph with large minimum degree. 313-318 - Ernest J. Cockayne, Christina M. Mynhardt:
A lower bound for the depression of trees. 319-328 - Daniel Král', Li-Da Tong, Xuding Zhu:
Upper hamiltonian numbers and hamiltonian spectra of graphs. 329-340 - Robert E. Jamison, Gaetano Quattrocchi:
Partial S(k-1, k, v)'s inducing Pk-decompositions of Kv. 341-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
