default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 46
Volume 46, Number 1, February 1989
- Medha Dhurandhar:
On the chromatic number of a graph with two forbidden subgraphs. 1-6 - Thomas Andreae, Martin Aigner:
The total interval number of a graph. 7-21 - Merrick L. Furst, Jonathan L. Gross, Richard Statman:
Genus distributions for two classes of graphs. 22-36 - Amanda G. Chetwynd
, Anthony J. W. Hilton:
A Delta-subgraph condition for a graph to be class 1. 37-45 - Alexander Schrijver:
Distances and cuts in planar graphs. 46-57 - Edward A. Bender, E. Rodney Canfield:
Face sizes of 3-polytopes. 58-65 - Michael B. Dillencourt:
An upper bound on the shortness exponent of inscribable polytopes. 66-83 - Nora Hartsfield, Gerhard Ringel:
Minimal quadrangulations of orientable surfaces. 84-95 - Seth Chaiken:
The Tutte polynomial of a ported matroid. 96-117 - Mark D. Halsey:
Extending a combinatorial geometry by adding a unique line. 118-120 - John P. Georges:
Non-hamiltonian bicubic graphs. 121-124
Volume 46, Number 2, April 1989
- Jaroslav Nesetril:
For graphs there are only four types of hereditary Ramsey classes. 127-132 - Jaroslav Nesetril, Vojtech Rödl:
Chromatically optimal rigid graphs. 133-141 - Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo:
Hamiltonian decomposition of Cayley graphs of degree 4. 142-153 - Ury Jamshy, Michael Tarsi:
Cycle covering of binary matroids. 154-161 - George R. T. Hendry:
Extending cycles in directed graphs. 162-172 - Dan Archdeacon, Phil Huneke:
A Kuratowski theorem for nonorientable surfaces. 173-231 - John Ginsburg, Bill Sands, Douglas B. West:
A length-width inequality for partially ordered sets with two-element cutsets. 232-239 - Amanda G. Chetwynd, Anthony J. W. Hilton, Dean G. Hoffman:
On the Delta-subgraph of graphs which are critical with respect to the chromatic index. 240-245 - Dieter Jungnickel, Matthias Leclerc:
The 2-matching lattice of a graph. 246-248 - Shmuel Friedland:
Every 7-regular digraph contains an even cycle. 249-252 - Luis A. Goddyn:
Cycle double covers of graphs with Hamilton paths. 253-254
Volume 46, Number 3, June 1989
- Carsten Thomassen:
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs. 257-291 - James G. Oxley:
The regular matroids with no 5-wheel minor. 292-305 - Martin Grötschel, Klaus Truemper:
Decomposition and optimization over cycles in binary matroids. 306-337 - Walter Klotz:
Clique covers and coloring problems of graphs. 338-345 - Karen Anne Johnson, Roger C. Entringer:
Largest induced subgraphs of the n-cube that contain no 4-cycles. 346-355 - Yoshimi Egawa, Takashi Miyamoto:
The longest cycles in a graph G with minimum degree at least |G|/k. 356-362 - Hong-Jian Lai:
Unique graph homomorphisms onto odd cycles, II. 363-376
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 2025-01-16 21:50 CET 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:
