default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 18
Volume 18, September 1998
- Roland Lortz, Ingrid Mengersen:
Size Ramsey results for paths versus stars. 3-12 - Dean G. Hoffman, Kimberly S. Kirkpatrick:
G-designs of order n and index λ where G has 5 vertices or less. 13-38 - B. S. P. Chan, John A. Eccleston:
On the construction of complete and partial nearest neighbour balanced designs. 39-50 - Elizabeth J. Billington, David A. Pike:
Decomposing block-intersection graphs of Steiner triple systems into triangles. 51-64 - Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joe Ryan, Jozef Sirán:
Large graphs with small degree and diameter: a voltage assignment approach. 65-76 - Günter F. Steinke:
Finite Möbius near-planes. 77-96 - Robert E. L. Aldred, Nicholas C. Wormald:
More on the linear k-arboricity of regular graphs. 97-104 - Sarah Zahrai:
Minimal bases for the laws of certain cycle systems. 105-110 - K. T. Arasu:
A reduction theorem for circulant weighing matrices. 111-114 - Teresa W. Haynes, Michael A. Henning:
Domination critical graphs with respect to relative complements. 115-126 - Changiz Eslahchi, Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
A counterexample for Hilton-Johnson's conjecture on list coloring of graphs. 127-132 - Noboru Ito:
On Hadamard 2-groups. 133-138 - F. Kamali, Hadi Kharaghani:
Dihedral Golay sequences. 139-146 - Cai Heng Li:
On finite graphs that are self-complementary and vertex transitive. 147-156 - Miwako Mishima, Ying Miao, Sanpei Kageyama, Masakazu Jimbo:
Constructions of nested directed BIB designs. 157-172 - Alan Hartman:
Algorithmic aspects of integral designs. 173-182 - Maria Flavia Mammana, Charles C. Lindner:
A small embedding for partial directed 6k-cycle systems. 183-192 - Nicholas J. Cavenagh:
Decompositions of complete tripartite graphs into k-cycles. 193-200 - Italo J. Dejter, David A. Pike, Christopher A. Rodger:
The directed almost resolvable Hamilton-Waterloo problem. 201-208 - Elizabeth J. Billington, Giovanni Lo Faro:
Repeated blocks in indecomposable twofold extended triple systems. 209-218 - Zbigniew Palka:
The strong edge colorings of a sparse random graph. 219-226 - Shao-Fei Du, Ru-Ji Wang, Ming-Yao Xu:
On the normality of Cayley digraphs of groups of order twice a prime. 227-234 - Weifan Wang, Kemin Zhang:
Edge-face chromatic number of plane graphs with high maximum degree. 235-244 - Dieter Rautenbach:
Bounds on the weak domination number. 245-252 - Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt:
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. 253-262 - Matthew M. Cropper:
Hall's condition yields less for multicolorings. 263-266 - Frank Lad:
How big is your mathematics? 267-274 - David M. Berman, Jiannong Liu, Hong Wang, Larry Wargo:
Induced stars in trees. 275-276 - Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski:
Disjoint and unfolding domination in graphs. 277-292 - Meike Tewes, Lutz Volkmann:
On the cycle structure of in-tournaments. 293-302 - Abdollah Khodkar, Dean G. Hoffman:
On the non-existence of Steiner (v, k, 2) trades with certain volumes. 303-312 - Hossein Hajiabolhassan, Mojtaba L. Mehrabadi:
On clique polynomials. 313-
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 2026-07-14 00:33 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
