Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 67
Volume 67, February 2017
- Ruixia Wang, Jing Guo:
A note on cycles of maximum length in bipartite digraphs. 1-10 - Brian Alspach, Donald L. Kreher, Adrián Pastine:
The Friedlander-Gordon-Miller conjecture is true. 11-24 - R. Julian R. Abel:
Existence of near resolvable (v, k, k-1) BIBDs with k∈{9, 12, 16}. 25-45 - P. Jeyanthi, N. T. Muthuraja, Andrea Semanicová-Fenovcíková, S. J. Dharshikha:
More classes of super cycle-antimagic graphs. 46-64
- C. Paul Bonnington, Jeffrey H. Dinitz, Jozef Sirán:
Special issue in honour of Dan S. Archdeacon: Guest Editorial. 65-76 - Seiya Negami:
Beans functions of graphs with small beans. 77-87 - Ted Dobson, Ademir Hujdurovic, Klavdija Kutnar, Joy Morris:
Vertex-transitive digraphs with extra automorphisms that preserve the natural arc-colouring. 88-100 - Atsuhiro Nakamoto, Kenta Ozeki:
Coloring of locally planar graphs with one color class small. 101-118 - Serge Lawrencenko, Mikhail N. Vyalyi, L. V. Zgonnik:
Grünbaum coloring and its generalization to arbitrary dimension. 119-130 - Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem). 131-144 - Dan Archdeacon, Kirsten Stor:
Superthrackles. 145-158 - Dan Archdeacon, Matt DeVos, Stefan Hannie, Bojan Mohar:
Whitney's theorem for 2-regular planar digraphs. 159-165 - Vasyl Ustimenko, Andrew J. Woldar:
A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes. 166-202 - Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker:
Valence-partitioned genus polynomials and their application to generalized dipoles. 203-221 - Sona Pavlíková:
A note on inverses of labeled graphs. 222-234 - Norman Biggs:
Chromatic polynomials and toroidal graphs. 235-242 - Dan Archdeacon, Terry S. Griggs, Constantinos Psomas:
Representing graphs in Steiner triple systems - II. 243-258 - Martin Bachratý, Robert Jajcay:
Classification of coset-preserving skew-morphisms of finite cyclic groups. 259-280 - Andrew Vince:
Counting connected sets and connected partitions of a graph. 281-293 - Chuan Guo, Douglas R. Stinson:
A tight bound on the size of certain separating hash families. 294-303 - Heather Jordon, Joy Morris:
Cyclic m-cycle systems of complete graphs minus a 1-factor. 304-326 - Jeffrey H. Dinitz, Amelia R. W. Mattern:
Biembedding Steiner triple systems and n-cycle systems on orientable surfaces. 327-344 - Dalibor Froncek:
Magic rectangle sets of odd order. 345-351 - Ian M. Wanless, Bridget S. Webb:
Small partial Latin squares that cannot be embedded in a Cayley table. 352-363 - Dan Archdeacon, C. Paul Bonnington, Bojan Mohar:
Embedding quartic Eulerian digraphs on the plane. 364-377 - Mariusz Meszka, Alexander Rosa, Beatrice Ruini:
Kite systems of order 8; embedding of kite systems into bowtie systems. 378-393 - Stefan Gyürki, Mikhail H. Klin:
Some new non-Schurian association schemes on 2p2 points, p an odd prime, and related combinatorial structures. 394-437
- Steven Schluchter:
Cosets, voltages, and derived embeddings. 438-462 - Megan Cream, Ronald J. Gould, Kazuhide Hirohata:
A note on extending Bondy's meta-conjecture. 463-469 - Michael Braun:
Designs over the binary field from the complete monomial group. 470-475 - Jaroslav Ivanco:
On k-total edge product cordial graphs. 476-485 - Susan G. Barwick, Wen-Ai Jackson, Tim Penttila:
New families of strongly regular graphs. 486-507 - Gábor Hegedüs:
Inequalities for two systems of subspaces with prescribed intersections. 508-
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:
