Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 29
Volume 29, March 2004
- Anton Betten:
Genealogy of t-designs. 3-34 - Danhong Zhang, Hong Wang:
A minimum degree result for disjoint cycles and forests in bipartite graphs. 35-48 - Stefan Winzen:
Strong subtournaments of close to regular multipartite tournaments. 49-58 - Elaine M. Eschen, Jianbing Niu:
On potentially (K4-e)-graphic sequences. 59-66 - E. Boudreau, Bert L. Hartnell, K. Schmeisser, J. Whiteley:
A game based on vertex-magic total labelings. 67-74 - Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs:
Configurations and trades in Steiner triple systems. 75-84 - Min Ho Lee:
Exterior derivatives and Laplacians on digraphs. 85-94 - Dingjun Lou, Huiquan Zhu:
A note on max-leaves spanning tree problem in Halin graphs. 95-98 - Duncan Campbell, Keith Edwards:
A new lower bound for the harmonious chromatic number. 99-102 - Toufik Mansour:
Restricted 132-Dumont permutations. 103-118 - Lutz Volkmann:
On the size of odd order graphs with no almost perfect matching. 119-126 - Dingjun Lou, Qinglin Yu:
Sufficient conditions for n-matchable graphs. 127-134 - Zemin Jin, Xueliang Li:
On a conjecture on k-walks of graphs. 135-142 - Laura M. Harris, Johannes H. Hattingh:
The algorithmic complexity of certain functional variations of total domination in graphs. 143-156 - K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and irredundance in tournaments. 157-172 - Abdollah Khodkar, M. A. Shahabi, Seyed Mahmoud Sheikholeslami:
Families of 2-critical sets for dihedral groups. 173-186 - Sergey Kitaev:
The sigma-sequence and counting occurrences of some patterns, subsequences and subwords. 187-200 - Michael U. Gerber, Daniel Kobler:
Classes of graphs that can be partitioned to satisfy all their vertices. 201-214 - Robert E. L. Aldred, Michael D. Plummer:
Edge proximity and matching extension in planar triangulations. 215-224 - D. G. Hoffman, Charles C. Lindner:
A partial K4-e-design of order n can be embedded in a K4-e-design of order at most 8n+16√n+82. 225-230 - L. Burnett, William Millan, Ed Dawson, Andrew J. Clark:
Simpler methods for generating better Boolean functions with good cryptographic properties. 231-248 - Atsuhiro Nakamoto:
Four-regular graphs that quadrangulate both the torus and the Klein bottle. 249-258 - Diana Combe, Adrian M. Nelson, William D. Palmer:
Magic labellings of graphs over finite abelian groups. 259-272 - Henning Fernau:
Complexity of a {0, 1}-matrix problem. 273-300 - R. Julian R. Abel, Diana Combe, William D. Palmer:
Bhaskar Rao designs and the groups of order 12. 301-308 - Christian Sloper:
An eccentric coloring of trees. 309-322 - Diane M. Donovan, Saad I. El-Zanati, Charles Vanden Eynden, Somporn Sutinuntopas:
Labelings of unions of up to four uniform cycles. 323-336 - Kishore Sinha, Sanpei Kageyama, Ashish Das, G. M. Saha:
Some series of block designs with nested rows and columns. 337-
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-04-25 21:59 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:
