default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 24
Volume 24, September 2001
- Anton Cerný:
On maximal premature partial Latin squares. 5-12 - Xiuling Shan, Qingde Kang, Qiujie Sun:
Self-converse Mendelsohn designs with odd block size. 13-34 - David R. B. Burgess, A. Donald Keedwell:
Weakly completable critical sets for proper vertex and edge colourings of graphs. 35-46 - Lane H. Clark:
The strong matching number of a random graph. 47-58 - Lucia Gionfriddo:
On the spectrum of nested G-designs, where G has four non-isolated vertices or less. 59-80 - Haipeng Luo, Wenlong Su, Yun-Qiu Shen:
New lower bounds of ten classical Ramsey numbers. 81-90 - Gary MacGillivray, Karen Seyffarth:
Classes of line graphs with small cycle double covers. 91-114 - Karen G. Harris:
The intersection problem for graphs with six vertices, six edges and a 4-cycle subgraph. 115-122 - Chunhui Lai:
A note on potentially K4-e graphical sequences. 123-128 - Watcharaphong Ananchuen:
On the adjacency properties of generalized Paley graphs. 129-148 - Watcharaphong Ananchuen:
A note on constructing digraphs with prescribed properties. 149-156 - Weifan Wang, Ko-Wei Lih:
The 4-choosability of planar graphs without 6-cycles. 157-164 - Ken-ichi Kawarabayashi:
Note on k-contractible edges in k-connected graphs. 165-168 - Caikun Liu, Qingde Kang, Zhifen Guo:
Self-converse Mendelsohn designs with block size 6q. 169-192 - Michael H. Albert, Robert E. L. Aldred, Derek A. Holton:
On 3*-connected graphs. 193-208 - Saad I. El-Zanati, Charles Vanden Eynden, Narong Punnim:
On the cyclic decomposition of complete graphs into bipartite graphs. 209-220 - Andrew Blinco:
On diagonal cycle systems. 221-230 - Alewyn P. Burger, Christina M. Mynhardt, Ernest J. Cockayne:
Queens graphs for chessboards on the torus. 231-246 - Dingjun Lou, Lihua Teng, Xiangjun Wu:
A polynomial algorithm for cyclic edge connectivity of cubic graphs. 247-260 - Geoffrey Exoo:
A trivalent graph of girth 17. 261-264 - Jiping Liu, Cheng Zhao:
On a conjecture of Hilton. 265-274 - Diana Combe, William D. Palmer, William R. Unger:
Bhaskar Rao designs and the alternating group A4. 275-284 - Michael D. Hirschhorn:
On partitions into four distinct squares of equal parity. 285-292 - Brendan D. McKay, Edward Spence:
Classification of regular two-graphs on 36 and 38 vertices. 293-300 - Midori Kobayashi, Gisaku Nakamura:
Uniform coverings of 2-paths by 4-paths. 301-304 - Ioan Tomescu:
The number of h-strongly connected digraphs with small diameter. 305-312 - Edoardo Ballico, Antonio Cossidente:
Finite field Nullstellensatz and Grassmannians. 313-
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-13 20:21 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:
