default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 40
Volume 40, Number 1, February 1986
- Fuji Zhang, Xiaofeng Guo:
Hamilton cycles in Euler tour graph. 1-8 - Carsten Thomassen:
Interval representations of planar graphs. 9-20 - Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller:
Concerning the achromatic number of graphs. 21-39 - Francisco Barahona, Martin Grötschel:
On the cycle polytope of a binary matroid. 40-62 - William J. Cook, Jean Fonlupt, Alexander Schrijver:
An integer analogue of Carathéodory's theorem. 63-70 - Larry Eggan, Michael Plantholt:
The chromatic index of nearly bipartite multigraphs. 71-80 - Walter Vogler:
Representing abstract groups by powers of a graph. 81-93 - Bojan Mohar:
A common cover of graphs and 2-cell embeddings. 94-106 - Dave Witte:
Cayley digraphs of prime-power order are hamiltonian. 107-112 - Herbert S. Wilf:
Spectral bounds for the clique and independence numbers of graphs. 113-117
Volume 40, Number 2, April 1986
- Edwin C. Ihrig:
Symmetry groups related to the construction of perfect one factorizations of K2n. 121-151 - Wolfgang Mader:
Kritisch n-fach kantenzusammenhängende Graphen. 152-158 - Robin W. Dawes:
Minimally 3-connected graphs. 159-168 - Ying Cheng, Albert L. Wells Jr.:
Switching classes of directed graphs. 169-186 - Geoffrey R. Grimmett:
An exact threshold theorem for random graphs and the node-packing problem. 187-195 - Alan M. Frieze
:
Maximum matchings in a class of random graphs. 196-212 - Paul M. Terwilliger:
A class of distance-regular graphs that are Q-polynomial. 213-223 - Jan Kratochvíl:
Perfect codes over graphs. 224-228 - Herbert Fleischner:
Proof of the strong 2-Cover Conjecture for planar graphs. 229-230 - Hiroshi Maehara:
Sphericity exceeds cubicity for almost all complete bipartite graphs. 231-235
Volume 40, Number 3, June 1986
- Yahya Ould Hamidoune, Michel Las Vergnas:
Directed Switching Games on graphs and matroids. 237-269 - Peter Frankl, Zoltán Füredi:
Extremal problems concerning Kneser graphs. 270-284 - Gérard Cornuéjols, David Hartvigsen:
An extension of matching theory. 285-296 - Edward A. Bender, L. Bruce Richmond:
A survey of the asymptotic behaviour of maps. 297-329 - Martin Grötschel, László Lovász, Alexander Schrijver:
Relaxations of vertex packing. 330-343 - Peter J. Cameron, Albert L. Wells Jr.:
Signatures and signed switching classes. 344-361 - Marston D. E. Conder:
A note on Cayley graphs. 362-368
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 2026-08-06 22:39 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
