default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 27
Volume 27, March 2003
- Nirmala Achuthan, A. Ramachandra Rao:
On the number of cut edges in a regular graph. 5-12 - M. H. Armanious:
Semi-planar Steiner quasigroups of cardinality 3n. 13-22 - Angelika Hellwig, Lutz Volkmann:
Maximally edge-connected digraphs. 23-32 - Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin:
Unique colorings of bi-hypergraphs. 33-46 - John A. Bate, G. H. John van Rees:
Minimal and near-minimal critical sets in back-circulant latin squares. 47-62 - William Duckworth:
Maximum 2-independent sets of random cubic graphs. 63-80 - Zaiping Lu, Ming-Yao Xu:
On the normality of Cayley graphs of order pq. 81-94 - Igor E. Zverovich:
The Domination number of (Kp, P5)-free graphs. 95-100 - Chunhui Lai:
Graphs without repeated cycle lengths. 101-106 - Sharlene M. Andrijich, Louis Caccetta:
The ambiguity problem arising in multisensor data association. 107-128 - Václav Linek:
Extending Skolem sequences, how can you begin? 129-138 - Mekkia Kouider, Preben D. Vestergaard:
On even [2, b]-factors in graphs. 139-148 - Gregory Z. Gutin, Anders Yeo:
Assignment problem based algorithms are impractical for the generalized TSP. 149-154 - Dianhua Wu:
Optimal holey packing OHP4(2, 4, v, 2) for v≡2 (mod 3). 155-162 - Kung-Kuen Tse:
On the Ramsey number of the quadrilateral versus the book and the wheel. 163-168 - Gengsheng Zhang, Kaishun Wang:
Some results on 2-homogeneous graphs. 169-174 - Vadim E. Zverovich:
On the differences of the independence, domination and irredundance parameters of a graph. 175-186 - Tom C. Brown, Allen R. Freedman, Peter Jau-Shyong Shiue:
Progressions of squares. 187-192 - Tom C. Brown, Wun-Seng Chou, Peter J.-S. Shiue:
On the partition function of a finite set. 193-204 - Charles J. Colbourn, Gaetano Quattrocchi, Alexander Rosa:
Resolving P(v, 3, λ) designs into regular P3-configurations. 205-212 - Spencer P. Hurd, Dinesh G. Sarvate:
Embeddings and faithful enclosings of GDDs with a constant number of groups. 213-222 - Lutz Volkmann, Stefan Winzen:
Cycles through a given arc in almost regular multipartite tournaments. 223-246 - Midori Kobayashi, Gisaku Nakamura, Chie Nara:
Uniform coverings of 2-paths with 5-paths in K2n. 247-252 - Daniel Král':
A counter-example to Voloshin's hypergraph co-perfectness conjecture. 253-262 - Tianbing Xia, Mingyuan Xia, Jennifer Seberry:
Regular Hadamard matrix, maximum excess and SBIBD. 263-276 - Suresh Manjanath Hegde, Sudhakar Shetty:
On magic graphs. 277-284 - Robin Chapman:
Partition identities arising from involutions. 285-292 - Mohammed M. M. Jaradat:
On the basis number of the direct product of graphs. 293-306 - Dan Archdeacon, Dalibor Froncek, Robert Jajcay, Zdenek Ryjácek, Jozef Sirán:
Regular clique covers of graphs. 307-
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-12 23:06 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:
