default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 54
Volume 54, October 2012
- Goldwyn Millar:
A class of mutually inequivalent circulant weighing matrices. 3-12 - Aleksander L. Owczarek, Thomas Prellberg:
Enumeration of area-weighted Dyck paths with restricted height. 13-18 - Darren B. Parker, Randy F. Westhoff:
Convex invariants in multipartite tournaments. 19-36 - Aloke Dey:
On the construction of nested orthogonal arrays. 37-48 - Michael H. Albert:
Young classes of permutations. 49-58 - Hong Wang:
An extension of the Corrádi-Hajnal Theorem. 59-84 - Farzane Amirzade, Nasrin Soltankhah:
Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets. 85-106 - Pak Kiu Sun, Wai Chee Shiu:
Some results on incidence coloring, star arboricity and domination number. 107-114 - Taher Abualrub, Nuh Aydin, Padmapani Seneviratne:
On θ-cyclic codes over 𝔽2 + v𝔽2. 115-126 - Petr Kovár, Tereza Kovárová, Dalibor Froncek:
A note on 4-regular distance magic graphs. 127-132 - Nader Jafari Rad, Chun-Hung Liu:
Trees with strong equality between the Roman domination number and the unique response Roman domination number. 133-140 - Ali Ahmad, Muhammad Kamran Siddiqui, Deeba Afzal:
On the total edge irregularity strength of zigzag graphs. 141-150 - Mathav Kishore Murugan, Sarah Spence Adams:
Hurwitz-Radon inspired maximal three-dimensional real orthogonal designs. 151-162 - Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano:
A secure additive protocol for card players. 163-176 - Khee Meng Koh, T. S. Ting, Feng Ming Dong:
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. 177-188 - Christopher P. Tuffley:
Counting the spanning trees of the 3-cube using edge slides. 189-206 - Martin Knor:
Small radial Moore graphs of radius 3. 207-216 - Emre Kolotoglu, Nicola Pace, Spyros S. Magliveras:
Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs. 217-230 - Frank E. Bennett, Hantao Zhang:
Holey Schröder designs of type 4n u1. 231-260 - Peter Dukes, Jesse Short-Gershman:
A complete existence theory for Sarvate-Beam triple systems. 261-272 - Peter J. Cameron, Bridget S. Webb:
Perfect countably infinite Steiner triple systems. 273-278 - S. Arumugam, Nainarraj Kamatchi:
On (a, d)-distance antimagic graphs. 279-288 - Sharareh Alipour, Ebadollah S. Mahmoodian, E. Mollaahmadi:
On decomposing complete tripartite graphs into 5-cycles. 289-302 - Helmut Prodinger:
Set partitions, words, and approximate counting with black holes. 303-
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-12-04 22:08 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:
