default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 12
Volume 12, September 1995
- Cai Heng Li:
Isomorphisms and classification of Cayley graphs of small valencies on finite Abelian groups. 3-14 - Peter Eades, Xuemin Lin:
A heuristic for the feedback arc set problem. 15-26 - Ulrich Teschner:
A new upper bound for the bondage number of graphs with small domination number. 27-36 - S. Ajoodani-Namini:
Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems. 37-58 - Nawarat Ananchuen, Lou Caccetta:
A note on k-extendable graphs and independence number. 59-66 - Ladislav Stacho:
On minimal outerplanar graphs of given diameter. 67-76 - A. El Maftouhi:
The minimum size of a maximal strong matching in a random graph. 77-80 - Bolian Liu, Dingjun Lou, Kewen Zhao:
A neighbourhood union condition for pancyclicity. 81-92 - Jixiang Meng, Mingyao Xu:
Automorphisms of groups and isomorphisms of Cayley digraphs. 93-100 - Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
The algorithmic complexity of signed domination in graphs. 101-112 - Charles H. C. Little, Hong Wang:
Vertex disjoint cycles in a directed graph. 113-120 - Charles C. Lindner, C. A. Rodger:
Blocking set preserving embeddings of partial K4, -, e designs. 121-126 - J. W. Giffin, K. Watson, Les R. Foulds:
Orthogonal layouts using the deltahedron heuristic. 127-144 - Patric R. J. Östergård:
New multiple covering codes by tabu search. 145-156 - Marc Gysin, Jennifer Seberry:
On the weighing matrices of order 4n and weight 4n-2 and 2n-1. 157-174 - Charles J. Colbourn, Lie Zhu:
Existence of six incomplete MOLS. 175-192 - Beiliang Du:
On the existence of three incomplete idempotent MOLS. 193-200 - R. Klein, Johanan Schönheim:
On the colorability of graphs decomposable into degenerate graphs with specified degeneracy. 201-208 - Giovanni Lo Faro:
A class of extended triple systems and numbers of common triples. 209-224 - D. G. Hoffman:
Digraphs of finite linear transformations. 225-238 - Elizabeth J. Billington, Donald L. Kreher:
The intersection problem for small G-designs. 239-258 - Charles J. Colbourn, Alexander Rosa:
Orthogonal resolutions of triple systems. 259-270 - W. P. Galvin:
Single-machine scheduling to minimize absolute lateness for a specified number of tardy jobs. 271-290 - David A. Pike:
Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree. 291-294 - M. L. Aggarwal, K. T. Arasu:
A new family of balanced incomplete block designs with nested rows and columns. 295-300 - Kimmo Eriksson:
Classroom note: An easy bijective proof of the matrix-forest theorem. 301-304 - Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám:
Regular digraphs of diamter 2 and maximum order: Corrigenda. 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-12-04 22:08 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:
