default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 66
Volume 66, October 2016
- Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Characterizing block graphs in terms of their vertex-induced partitions. 1-9 - Masaaki Harada, Sho Suda:
On binary codes related to mutually quasi-unbiased weighing matrices. 10-22 - Thomas A. McCourt, Justin Z. Schroeder:
Self-embeddings of doubled affine Steiner triple systems. 23-43 - Jeremy F. Alm, Jacob Manske:
The vector graph and the chromatic number of the plane, or how NOT to prove that χ(E2)>4. 44-49 - Zhongyuan Che, Zhibo Chen:
Minimum order of r-regular bipartite graphs of pair length k. 50-65 - John M. Campbell:
Bipieri tableaux. 66-103 - Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Partitions according to multiplicities and part sizes. 104-119 - Y. M. Borse, A. V. Sonawane, S. R. Shaikh:
Connected bipancyclic isomorphic m-factorizations of the Cartesian product of graphs. 120-129 - Mike J. Grannell, Graham J. Lovegrove:
Identical twin Steiner triple systems. 130-141
- Emilio Pierro:
The Mobius function of the small Ree groups. 142-176 - Cayla D. McBee, Tim Penttila:
Remarks on Hadamard conjugation and combinatorial phylogenetics. 177-191 - Isaac B. Michael, Mark Roger Sepanski:
Net regular trees. 192-204 - William M. Kantor:
Cyclic elliptic spreads. 205-210 - Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens:
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. 211-228 - R. Lakshmi, S. Vidhyapriya:
Kernels in Cartesian products of digraphs. 229-239 - Zoltán Lóránt Nagy:
Density version of the Ramsey problem and the directed Ramsey problem. 240-255 - Gábor Hegedüs:
A generalization of the Erdős-Ko-Rado Theorem. 256-264 - Peter Borg:
Intersecting integer partitions. 265-275 - Kenneth J. Dykema:
Generating functions for purely crossing partitions. 276-287 - Doost Ali Mojdeh, Morteza Alishahi, Mustapha Chellali:
Trees with the same global domination number as their square. 288-309 - Laïche Daouya, Isma Bouchemakh, Éric Sopena:
On the packing coloring of undirected and oriented generalized theta graphs. 310-329 - Andries E. Brouwer, Supalak Sumalroj, Chalermpong Worawannotai:
The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10;1, 2, 18} and {36, 28, 4;1, 2, 24}. 330-332 - Dinesh G. Sarvate, Li Zhang:
Group divisible designs of three groups and block size five with configuration (1, 2, 2). 333-343 - Elahe Sharifi, Nader Jafari Rad:
A note on the independence number in bipartite graphs. 344-349
- Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith:
Probabilistic lower bounds on maximal determinants of binary matrices. 350-364 - P. Anusha Devi, S. Monikandan:
Degree associated reconstruction number of connected digraphs with unique end vertex. 365-377 - Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit:
List backbone coloring of paths and cycles. 378-392 - Paola Bonacini, Mario Gionfriddo, Lucia Marino:
Nonagon quadruple systems: existence, balance, embeddings. 393-406 - Nancy E. Clarke, Asiyeh Sanaei:
Skolem labellings of generalised Dutch windmills. 407-419 - Nader Jafari Rad, Hadi Rahbani:
A note on the locating-total domination in trees. 420-424 - Günter F. Steinke:
On Kleinewillinghöfer types of finite Laguerre planes with respect to homotheties. 425-435 - Nawarat Ananchuen, Watcharaphong Ananchuen, Akira Saito:
Extendability of the complementary prism of bipartite graphs. 436-448
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-01-24 17:04 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:
