default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 39
Volume 39, October 2007
- David James Ashe, C. David Leach, Christopher A. Rodger:
2-Regular leaves of partial 8-cycle systems. 3-18 - Tiffany Rose Andrus, Neil P. Carnes:
A class of antiautomorphisms of Mendelsohn triple systems with two cycles. 19-26 - Lingli Sun:
The Erdős-Sós conjecture for spiders of diameter 9. 27-38 - Ilias S. Kotsireas, Christos Koukouvinos:
Orthogonal designs of order 32 and 64 via computational algebra. 39-48 - Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Some strings in Dyck paths. 49-72 - Mieko Yamada:
Supplementary difference sets constructed from (q+1)st cyclotomic classes in GF(q2). 73-88 - Grady Bullington, Linda Eroh, Kevin McDougal, Hosien Moghadam, Steven J. Winters:
Path and cycle decomposition numbers. 89-102 - Narong Punnim:
Interpolation theorems in jump graphs. 103-114 - Tatjana Gerzen, Bert Randerath:
Factoring logic functions using star-colorings. 115-128 - Clay Culver, C. David Leach:
Equivalence classes of 5-bit Gray codes. 129-134 - Richard H. Hammack:
Fractional graphs. 135-140 - Veerle Fack, Brendan D. McKay:
A generalized switching method for combinatorial estimation. 141-154 - Yunjian Wu, Qinglin Yu:
Uniform star-factors of graphs with girth three. 155-162 - T. Aaron Gulliver, Masaaki Harada, Hiroki Miyabayashi:
Optimal double circulant self-dual codes over 𝔽4 II. 163-174 - Xuelian Wen, Dingjun Lou:
Path decomposition of defect 1-extendable bipartite graphs. 175-182 - Tomás Vetrík:
Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4. 183-190 - Chengmin Wang:
Resolvable holey group divisible designs with block size three. 191-206 - Sasha Logan Jarrell, Christopher A. Rodger:
Maximal sets of Hamilton cycles in complete multipartite graphs II. 207-218 - Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri:
Locating-domination and identifying codes in trees. 219-232 - Sascha Kurz, Reinhard Laue:
Bounds for the minimum diameter of integral point sets. 233-240 - Gurusamy Rengasamy Vijayakumar:
Partitions of the edge set of a graph into internally disjoint paths. 241-246 - Ian M. Wanless:
A computer enumeration of small latin trades. 247-258 - Antonio Bernini, Luca Ferrari:
Order properties of the Motzkin and Schroder families. 259-272 - Elie Feder, David Garber:
Towards the computation of the convex hull of a configuration from its corresponding separating matrix. 273-282 - S. Arumugam, K. Jacob, Lutz Volkmann:
Total and connected domination in digraphs. 283-292 - Thomas W. Cusick, Harold Fredricksen, Pantelimon Stanica:
On the delta sequence of the Thue-Morse sequence. 293-300 - Dirk Meierling, Lutz Volkmann:
On the number of nonseparating vertices in strongly connected local tournaments. 301-
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-11-28 23:55 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:
