default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 11
Volume 11, March 1995
- Robert E. L. Aldred, Robert L. Hemminger:
On Hamilton cycles and contractible edges in 3-connected graphs. 3-24 - Vitaly I. Voloshin:
On the upper chromatic number of a hypergraph. 25-46 - Karl H. Wehrhahn:
Applications of Narayana's formula. 47-58 - Nasrin Soltankhah:
On directed trades. 59-66 - Dane L. Flannery:
Transgression and the calculation of cocyclic matrices. 67-78 - Peter B. Gibbons, Rudolf Mathon:
Signings of group divisible designs and projective planes. 79-104 - Jeffrey H. Dinitz, W. J. Martin:
The stipulation polynomial of a uniquely list-colorable graph. 105-116 - Zhicheng Gao, R. Bruce Richter, Xingxing Yu:
2-walks in 3-connected planar graphs. 117-122 - A. Baliga, Kathy J. Horadam:
Cocyclic Hadamard matrices over ℤt × ℤ22. 123-134 - Noboru Ito:
Note on Hadamard groups and difference sets. 135-138 - Marston D. E. Conder, Margaret Morton:
Classification of trivalent symmetric graphs of small order. 139-150 - Heiko Harborth, Ingrid Mengersen, Richard H. Schelp:
The drawing Ramsey number Dr(Kn). 151-156 - Guantao Chen, Lisa R. Marcus, Richard H. Schelp:
Vertex disjoint cycles for star free graphs. 157-168 - Yabao Guo, Lutz Volkmann:
Tree-Ramsey numbers. 169-176 - Dinesh G. Sarvate:
Note on parameters of balanced ternary designs. 177-180 - Gennian Ge, Lie Zhu:
Existence of almost resolvable directed 5-cycle systems. 181-196 - Peter Adams, Darryn E. Bryant, Saad I. El-Zanati:
Lambda-fold cube decompositions. 197-210 - Beiliang Du:
On complementary path decompositions of the complete multigraph. 211-214 - Derek A. Holton, Dingjun Lou, K. L. McAvaney:
n-extendability of line graphs, power graphs, and total graphs. 215-222 - Szu-En Cheng:
Matrix constructions of family (A) group divisible designs. 223-232 - Jorge L. Ramírez Alfonsín:
Cycle decompositions of complete and complete multipartite graphs. 233-238 - R. G. Stanton:
A study of hendecads. 239-246 - Robert L. Constable, Donald A. Preece, Nicholas C. K. Phillips, Thomas Dale Porter, Walter D. Wallis:
Single change neighbor designs. 247-256 - G. Li, B. Wei, T. Gao:
A structural method for Hamiltonian graphs. 257-262 - C. C. Chen, T. A. Peng:
Classroom note: Almost-isosceles right-angled triangles. 263-
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-23 00:32 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:
