default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 2
Volume 2, September 1990
- Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On the Nordhaus-Gaddum class problems. 5-28 - N. R. Achuthan, Mudin Simanihuruk:
On potentially P-graphic degree sequences. 29-38 - Brian Alspach, Katherine Heinrich:
Matching designs. 39-56 - Sheng Bau:
Cycles containing a set of elements in cubic graphs. 57-76 - Frank E. Bennett:
Pairwise balanced designs with block sizes 4 and 8. 77-100 - K. Budayasa, Lou Caccetta:
On critically k-edge-connected graphs. 101-110 - Yeow Meng Chee, Charles J. Colbourn, Steven Furino, Donald L. Kreher:
Large sets of disjoint t-designs. 111-120 - Roger B. Eggleton, Latif Al-Hakim, James Arthur MacDougall:
Braced edges in plane triangulations. 121-134 - Bill Jackson, Nicholas C. Wormald:
k-walks of graphs. 135-146 - Amram Meir, John W. Moon:
On the maximum out-degree in random trees. 147-156 - Alan Rahilly:
Semiregular group divisible designs whose duals are semiregular. 157-180 - R. G. Stanton, R. W. Buskens:
An upper approximation to the BIBD (15, 21, 7, 5, 2). 181-190 - Marta Sved, Robert J. Clarke:
King's walk on the infinite chessboard. 191-216 - Roberto Tamassia:
Drawing algorithms for planar st-graphs. 217-236 - W. D. Wallis:
Not all perfect extrinsic secret sharing schemes are ideal. 237-
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:
