


default search action
The Australasian Journal of Combinatorics, Volume 21
Volume 21, March 2000
- Rolf S. Rees, Nabil Shalaby, Ahmad Sharary:

Indecomposable Skolem and Rosa sequences. 3-12 - Changiz Eslahchi:

Characterization of graphs with Hall index 2. 13-22 - Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang:

How large can the domination numbers of a graph be? 23-36 - Gennian Ge:

Generalized Steiner triple systems with group size g≡1, 5 (mod 6). 37-48 - Chi-i Chan, Tsuyoshi Nishimura:

A recursive theorem on matching extension. 49-56 - Edoardo Ballico, Antonio Cossidente:

On the finite field Nullstellensatz. 57-60 - Jiong-Sheng Li, Ping Wang:

On the normality of Cayley digraphs of valency 2 on non-abelian groups of odd square free order. 61-66 - Mike J. Grannell, Terry S. Griggs, Alexander Rosa:

Three-line chromatic indices of Steiner triple systems. 67-84 - R. Julian R. Abel, Frank E. Bennett, Hantao Zhang, Lie Zhu:

A few more incomplete self-orthogonal Latin squares and related designs. 85-94 - Lutz Volkmann:

Longest paths through an arc in strongly connected in-tournaments. 95-106 - Diane M. Donovan, Adelle Howse:

Towards the spectrum of critical sets. 107-130 - Jürgen Bierbrauer, T. Aaron Gulliver:

New linear codes over 𝔽9. 131-140 - Chuan-Kun Wu, Ed Dawson:

Construction of correlation immune Boolean functions. 141-166 - Angela Niculitsa, Heinz-Jürgen Voss:

A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n-1 and n-2. 167-178 - Hong Wang:

On the maximal number of vertices covered by disjoint cycles. 179-186 - Chengde Wang, Philip A. Leonard:

More on sequences in groups. 187-196 - Beiliang Du:

P2k-factorization of complete bipartite multigraphs. 197-200 - Dingjun Lou:

On matchability of graphs. 201-210 - Changiz Eslahchi, Anthony J. W. Hilton, Peter D. Johnson Jr.:

Progress on the Hall-Number-Two problem. 211-236 - Ligong Wang, Xueliang Li:

Some new classes of integral trees with diameters 4 and 6. 237-244 - Kazuhiko Ushio:

Evenly partite bigraph-factorization of symmetric complete tripartite digraphs. 245-250 - Bo Zhou:

Improvements on inequalities for non-negative matrices. 251-256 - Midori Kobayashi, Nobuaki Mutoh, Gisaku Nakamura:

New infinite classes of 1-factorizations of complete graphs. 257-270 - Helmut Prodinger:

A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher. 271-274 - Saad I. El-Zanati, M. J. Kenig, Charles Vanden Eynden:

Near α-labelings of bipartite graphs. 275-286 - Kevin T. Phelps:

An enumeration of 1-perfect binary codes. 287-298 - Fernanda Pambianco, Emanuela Ughi:

A class of k-caps having k-2 points in common with an elliptic quadric and two points on an external line. 299-310 - Derek A. Holton, Robert E. L. Aldred:

Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum. 311-

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














