default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 28
Volume 28, September 2003
- Ahmed M. Assaf, H. Alhalees, L. P. S. Singh:
Directed covering with block size 5 and v even. 3-24 - Varaporn Saenpholphat, Ping Zhang:
On connected resolvability of graphs. 25-38 - Xiang-Feng Pan, Jingzhong Mao, Huiqing Liu:
Minimally (k, k-1)-edge-connected graphs. 39-50 - Zhihe Liang:
Graph designs, packings and coverings of λKv with a graph of six vertices and containing a triangle. 51-66 - Bo Zhou:
Exponents of primitive graphs. 67-72 - Yinglie Jin, Chunlin Liu:
The enumeration of labelled spanning trees of Km, n. 73-80 - Shangwang Tan, Bolian Liu, Delong Zhang:
Extreme tournaments with given primitive exponents. 81-92 - Anthony J. W. Hilton, Jiping Liu, Cheng Zhao:
The total chromatic numbers of joins of sparse graphs. 93-106 - Neil P. Carnes, Anne Dye, James F. Reed:
Some bicyclic antiautomorphisms of directed triple systems. 107-120 - Kerstin Bongard, Arne Hoffmann, Lutz Volkmann:
Minimum degree conditions for the Overfull Conjecture for odd order graphs. 121-130 - Jana Siagiová:
Composition of regular coverings of graphs and voltage assignments. 131-136 - Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley:
The domination number of the toroidal queens graph of size 3k×3k. 137-148 - M. A. Nyblom, C. D. Evans:
On the enumeration of partitions with summands in arithmetic progression. 149-160 - Stefano Marcugini, Fernanda Pambianco:
Minimal 1-saturating sets in PG(2, q), q≤16. 161-170 - Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds. 171-200 - Andrzej Czygrinow, Glenn Hurlbert:
Pebbling in dense graphs. 201-208 - Liping Yuan, Ren Ding:
Helly-type problems for convex quadrilaterals in the plane. 209-216 - C. Paul Bonnington, Sandi Klavzar, Alenka Lipovec:
On cubic and edge-critical isometric subgraphs of hypercubes. 217-224 - Michael H. Albert, Robert E. L. Aldred, Michael D. Atkinson, Hans P. van Ditmarsch, B. D. Handley, Chris C. Handley, Jaroslav Opatrny:
Longest subsequences in permutations. 225-238 - Gengsheng Zhang, Kaishun Wang:
A directed version of Deza graphs - Deza digraphs. 239-244 - Jim A. MacDougall, Walter D. Wallis:
Strong edge-magic labelling of a cycle with a chord. 245-256 - W. M. B. Dukes:
Bounds on the number of generalized partitions and some applications. 257-262 - Aristidis Sapounakis, Panagiotis Tsikouras:
Noncrossing partitions with fixed points. 263-272 - Rommel M. Barbosa, Mark N. Ellingham:
A characterisation of cubic parity graphs. 273-294 - Yusen Zhang, Tianming Wang:
Note on summation formulas derived from an identity of F.H. Jackson. 295-304 - Mirka Miller, Chris Rodger, Rinovia Simanjuntak:
Distance magic labelings of graphs. 305-
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-10-19 21:48 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
