default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 48
Volume 48, October 2010
- Anne Penfold Street:
Ralph Gordon Stanton. 3-4 - Siddani Bhaskara Rao, B. Devadas Acharya, Tarkeshwar Singh, Mukti Acharya:
Hypergraceful complete graphs. 5-24 - Kim A. S. Factor, Larry J. Langley:
Digraphs with isomorphic underlying and domination graphs: 4-cycles and pairs of paths. 25-42 - K. T. Arasu, Ilias S. Kotsireas, Christos Koukouvinos, Jennifer Seberry:
On circulant and two-circulant weighing matrices. 43-52 - Andrew Hudson, Tim Penttila:
A family of translation planes. 53-56 - Mark Ramras:
Balanced independent sets in hypercubes. 57-72 - Wlodzimierz Ulatowski:
All graphs with restrained domination number three less than their order. 73-86 - David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the sizes of the graphs G, Gr, Gr \ G: the directed case. 87-110 - Jingyu Wang, Jianping Ou, Tiedan Zhu:
On restricted edge connectivity of regular Cartesian product graphs. 111-116 - Yuri Yoshida, Tatsuya Maruta:
An extension theorem for [n, k, d]d codes with gcd(d, q)=2. 117-132 - Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely:
A note on full transversals and mixed orthogonal arrays. 133-142 - Ian T. Roberts, Leanne J. Rylands, Terry Montag, Martin Grüttmüller:
On the number of minimal completely separating systems and antichains in a Boolean lattice. 143-158 - Anders Claesson, Sergey Kitaev, Kári Ragnarsson, Bridget Eileen Tenner:
Boolean complexes for Ferrers graphs. 159-174 - B. Chaluvaraju, Mustapha Chellali, K. A. Vidya:
Perfect k-domination in graphs. 175-184 - Araya Chaemchan:
The edge domination number of connected graphs. 185-190 - Michael J. Ferrara, Michael S. Jacobson, Angela K. Harlan:
Hamiltonian cycles avoiding sets of edges in a graph. 191-204 - Laura J. Culp, Richard H. Hammack:
An isomorphism theorem for digraphs. 205-212 - Grant Cairns, Nhan Bao Ho:
Ultimately bipartite subtraction games. 213-220 - Michael Giudici, Aedan Pope:
The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m. 221-230 - Mostafa Blidia, Lyes Ould-Rabah:
Bounds on the domination number in oriented graphs. 231-242 - Judy-anne H. Osborn:
Bi-banded paths, a bijection and the Narayana numbers. 243-252 - Csilla Bujtás, Zsolt Tuza:
Voloshin's conjecture for C-perfect hypertrees. 253-268 - Zhaohong Niu, Liming Xiong:
Even factor of a graph with a bounded number of components. 269-280 - Lakoa Fitina, C. T. Lenard, T. M. Mills:
A note on the connectivity of the Cartesian product of graphs. 281-284 - Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
Double domination edge removal critical graphs. 285-
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 2025-06-05 20:22 CEST 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:
