default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 31
Volume 31, February 2005
- Igor E. Zverovich, Inessa I. Zverovich:
Closure of K1 + 2K2-free graphs. 3-14 - Toufik Mansour:
Squaring the terms of an ℓth order linear recurrence. 15-20 - Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein:
1-identifying codes on trees. 21-36 - Anders Sune Pedersen:
On equality in Berge's classical bound for the domination number. 37-46 - Anna Lladó, Susana-Clara López Masip:
Minimum tree decompositions with a given tree as a factor. 47-60 - Lutz Volkmann, Stefan Winzen:
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c. 61-84 - Petros Hadjicostas, K. B. Lakshmanan:
Bubble sort with erroneous comparisons. 85-106 - Mária Ipolyiová:
The minimal polynomial of 2cos(π/p) and its application to regular maps of large planar width. 107-118 - Lutz Volkmann:
Complementary cycles in regular multipartite tournaments. 119-134 - Jessica Cuomo, Nkiruka Nwasokwa, Vadim Ponomarenko:
Jump systems and laminated Manhattan sets. 135-144 - Vito Napolitano:
On some finite linear spaces with few lines. 145-160 - Shu-Guang Guo:
A conjecture on subset sums of a finite set of positive integers. 161-166 - Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
Altitude of small complete and complete bipartite graphs. 167-178 - Simona Bonvicini, Gloria Rinaldi:
Minkowski tangent-circle structures and key distribution patterns. 179-188 - Shinya Fujita:
Vertex-disjoint copies of K4- in graphs. 189-200 - Tomokazu Nagayama, Liang Zhang:
Long cycles through specified edges and vertices. 201-216 - Atif A. Abueida, Wiebke S. Diestelkamp, Stephanie P. Edwards, Darren B. Parker:
Determining properties of a multipartite tournament from its lattice of convex subsets. 217-230 - Steven T. Dougherty, Manish K. Gupta, Keisuke Shiromoto:
On generalized weights for codes over ℤk. 231-248 - Weigen Yan, Fuju Zhang:
Indices of convergence on four digraph operators. 249-262 - Manish K. Gupta:
On ℤ4 codes satisfying the chain condition. 263-272 - Marcel Abas:
Triangular Cayley maps of Kn, n, n. 273-286 - Beiliang Du:
Splitting balanced incomplete block designs. 287-298 - Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. 299-312 - Ioan Tomescu:
Almost all graphs and h-hypergraphs have small diameter. 313-324 - Manouchehr Zaker:
Grundy chromatic number of the complement of bipartite graphs. 325-330 - Darryn E. Bryant, C. David Leach, Christopher A. Rodger:
Hamilton decompositions of complete bipartite graphs with a 3-factor leave. 331-336 - Steven T. Dougherty:
A new construction of self-dual codes from projective planes. 337-
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-05 22:24 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:
