default search action
The Australasian Journal of Combinatorics, Volume 41
Volume 41, June 2008
- Yuejian Peng:
A note on non-jumping numbers. 3-14 - Margaret-Ellen Messinger:
Average firefighting on infinite grids. 15-28 - Hongtao Zhao, Yanfang Zhang:
Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems. 29-36 - Peter Danziger, Chengmin Wang:
Resolvable modified group divisible designs with higher index. 37-44 - Bostjan Bresar, Simon Spacapan:
On the connectivity of the direct product of graphs. 45-56 - Andrew Beveridge, Oleg Pikhurko:
On the connectivity of extremal Ramsey graphs. 57-62 - Eyal Loz, Jozef Sirán:
New record graphs in the degree-diameter problem. 63-80 - Tero Laihonen, Julien Moncel:
On graphs admitting t-ID codes. 81-92 - Ján Plesník:
Examples of goal-minimally k-diametric graphs for some small values of k. 93-106 - Criel Merino:
On the number of tilings of the rectangular board with T-tetronimoes. 107-114 - Jocelyn Quaintance:
Letter representations of n×n×p proper arrays. 115-138 - Dean Crnkovic:
A series of Siamese twin designs intersecting in a BIBD and a PBD. 139-146 - Wai Chee Shiu, Richard M. Low:
Ring-magic labelings of graphs. 147-158 - Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan:
Antimedian graphs. 159-170 - Dianhua Wu, Zhilin Chen, Minquan Cheng:
A note on the existence of balanced (q, {3, 4}, 1) difference families. 171-174 - C. A. Baker, J. D. A. Manzer:
Skolem-labeling of generalized three-vane windmills. 175-204 - Zeling Shao, Yanpei Liu:
Genus distributions of orientable embeddings for two types of graphs. 205-218 - Lutz Volkmann:
A characterization of bipartite graphs with independence number half their order. 219-222 - Henry Martyn Mulder, Michael J. Pelsmajer, K. Brooks Reid:
Axiomization of the center function on trees. 223-226 - Giuseppe Mazzuoccolo:
Perfect one-factorizations in line-graphs and planar graphs. 227-234 - Ilias S. Kotsireas, Christos Koukouvinos:
New skew-Hadamard matrices via computational algebra. 235-248 - Adelaide Rose Merlyn Saldanha, S. Parameshwara Bhatta:
On counting n-element trellises having exactly one pair of noncomparable elements. 249-256 - Andrei Gagarin:
Improved upper bounds for the k-tuple domination number. 257-262 - Changping Wang:
The negative decision number in graphs. 263-272 - Andrea Vietri:
A new infinite family of graceful generalised Petersen graphs, via graceful collages again. 273-282 - K. Ramanjaneyulu, V. Ch. Venkaiah, Kishore Kothapalli:
Anti-magic labellings of a class of planar graphs. 283-290 - Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Signed edge majority domination numbers in graphs. 291-296 - Donald A. Preece:
Daisy chains - a fruitful combinatorial concept. 297-
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 2024-12-15 01:16 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: