Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 149
Volume 149, Numbers 1-3, February 1996
- Peter Adams, Elizabeth J. Billington, Darryn E. Bryant
:
Partitionable perfect cycle systems with cycle lengths 6 and 8. 1-9 - Pedro Berrizbeitia, Reinaldo E. Giudici:
Counting pure k cycles in sequences of Cayley graphs. 11-18 - Jianer Chen, Dan Archdeacon, Jonathan L. Gross:
Maximum genus and connectivity. 19-29 - Tristan Denley:
The Ramsey numbers for disjoint unions of cycles. 31-44 - Guoli Ding, Bogdan Oporowski:
On tree-partitions of graphs. 45-58 - Kequan Ding, Paul M. Terwilliger:
On Garsia-Remmel problem of rook equivalence. 59-68 - Martin Goldstern, Rami P. Grossberg, Menachem Kojman:
Infinite homogeneous bipartite graphs with unequal sides. 69-82 - T. Aaron Gulliver:
Two new optimal ternary two-weight codes and strongly regular graphs. 83-92 - S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Star arboricity of graphs. 93-98 - Xiang-dong Hou:
GL(m, 2) acting on R(r, m)/R(r-1, m). 99-122 - Glenn Hurlbert, Garth Isaak:
Equivalence class universal cycles for permutations. 123-129 - Khee Meng Koh, B. P. Tan:
The diameter of an orientation of a complete multipartite graph. 131-139 - Bojan Mohar, Neil Robertson, Richard P. Vitray:
Planar graphs on the projective plane. 141-157 - Haiko Müller:
On edge perfectness and classes of bipartite graphs. 159-187 - Carles Padró, Paz Morillo:
Diameter vulnerability of iterated line digraphs. 189-204 - François Rodier:
Estimation asymptotique de la distance minimale du dual des codes BCH et polynômes de Dickson. 205-221 - Brigitte Servatius, Herman Servatius:
Self-dual graphs. 223-232 - Geoff Whittle:
Inequivalent representations of ternary matroids. 233-238 - Ross Willard:
Essential arities of term operations in finite algebras. 239-259 - Xiaoya Zha:
On minimum-genus embeddings. 261-278 - Claude A. Christen, Giovanni Coray, Stanley M. Selkow:
A characterization of n-component graphs. 279-281 - Vladimir D. Tonchev:
The uniformly packed binary [27, 21, 3] and [35, 29, 3] codes. 283-288 - Rudolf Ahlswede, Levon H. Khachatrian:
A counterexample to Aharoni's strongly maximal matching conjecture. 289 - Thomas Andreae:
On independent cycles and edges in graphs. 291-297 - Thomas Andreae, Carsten Flotow:
On covering all cliques of a chordal graph. 299-302 - Robert J. Cimikowski, Don Coppersmith:
The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. 303-309 - Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in regular graphs. 311-312 - B. G. Eke:
Coprimes in blocks of successive integers. 313-317 - Ferran Hurtado, Marc Noy:
Ears of triangulations and Catalan numbers. 319-324 - Jennifer J. Quinn:
Cycle packings in graphs and digraphs. 325-328
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-05-07 23:53 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:
