Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 37
Volume 37, February 2007
- Aung Kyaw:
A sufficient condition for spanning trees with bounded maximum degree in a graph. 3-10 - Haixing Zhao, Xueliang Li, Ruying Liu:
Chromaticity of the Complements of Some Sparse Graphs. 11-20 - Gang Chen:
A note on potentially K1, 1, t-graphic sequences. 21-26 - Shengjia Li, Ruijuan Li, Jinfeng Feng:
The graphs satisfying conditions of Ore's type. 27-32 - Saieed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody:
On rainbow cycles in edge colored complete graphs. 33-42 - Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Compositions of pattern restricted sets of permutations. 43-56 - Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. 57-66 - Magdalena Lemanska:
Lower bound on the weakly connected domination number of a tree. 67-72 - Andrea Vietri:
On certain 2-rotational cycle systems of complete graphs. 73-80 - Aihong Wu:
Large sets of disjoint directed and Mendelsohn packing triple systems on 6k+5 points. 81-88 - Edward Dobson:
Packing trees of bounded diameter into the complete graph. 89-100 - Arthur T. Benjamin, Michael D. Hirschhorn:
A combinatorial solution to intertwined recurrences. 101-116 - Tianbing Xia, Ming-Yuan Xia, Jennifer Seberry:
Some new results of regular Hadamard matrices and SBIBD II. 117-126 - Vito Napolitano:
Note: A new proof of an inequality for finite planar spaces. 127-130 - Abdollah Khodkar, Seyed Mahmoud Sheikholeslami:
On perfect double dominating sets in grids cylinders and tori. 131-140 - R. Julian R. Abel:
Some new near resolvable BIBDs with k=7 and resolvable BIBDs with k=5. 141-146 - Antonio Cossidente, Giuseppe Marino:
On certain group embeddings in cross characteristic. 147-154 - Alejandro Aguado, Saad I. El-Zanati, Heidi Hake, Jessica Stob, Hera Yayla:
On ρ-labeling the union of three cycles. 155-170 - Andrea Vietri:
Nice lists of differences, and their connections with algebraic properties of unitary polynomials. 171-186 - Stephan G. Wagner:
On the average Wiener index of degree-restricted trees. 187-204 - Sarah K. Bleiler, John T. Saccoman:
A correction in the formula for the number of spanning trees in threshold graphs. 205-214 - Chengde Wang:
More R-sequenceable Groups. 215-224 - E. J. Cheon:
On the upper bound of the minimum length of 5-dimensional linear codes. 225-232 - Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Perfect hash families from transversal designs. 233-242 - S. Arumugam, I. Sahul Hamid:
Simple acyclic graphoidal covers in a graph. 243-256 - Morteza Esmaeili, T. Aaron Gulliver:
On the [32, 16, 8] BCH and quadratic residue codes. 257-264 - Sizhong Zhou, Xiuqian Xuan:
Complete-factors and (g, f)-covered graphs. 265-270 - Lingli Sun:
On the Loebl-Komlós-Sós conjecture. 271-276 - Kiki A. Sugeng, Joe Ryan:
On several classes of monographs. 277-284 - R. S. Manikandan, P. Paulraja:
C5-decompositions of the tensor product of complete graphs. 285-294 - Dmitry Finozhenok, William D. Weakley:
An improved lower bound for domination numbers of the Queen's graph. 295-300 - David Cariolaro:
On the Ramsey number R(3, 6). 301-304 - Yi-Zheng Fan, Haiyan Hong, Shi-Cai Gong, Yi Wang:
Order unicyclic mixed graphs by spectral radius. 305-
a service of 
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-07-03 21:36 CEST 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:
