Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comb.~Theory Series B AND Volume=46
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the chromatic number of a graph with two forbidden subgraphs
Medha Dhurandhar
Journal of Combinatorial Theory Series B
46
, 1989, pp. 1-6
The total interval number of a graph
T. Andreae
,
M. Aigner
Journal of Combinatorial Theory Series B
46
, 1989, pp. 7-21
Genus distributions for two classes of graphs
Merrick L. Furst
,
Jonathan L. Gross
,
Richard Statman
Journal of Combinatorial Theory Series B
46
, 1989, pp. 22-36
A
\Delta
-subgraph condition for a graph to be class 1
A.G. Chetwynd
,
A.J.W. Hilton
Journal of Combinatorial Theory Series B
46
, 1989, pp. 37-45
Distances and cuts in planar graphs
A. Schrijver
Journal of Combinatorial Theory Series B
46
, 1989, pp. 46-57
Face sizes of 3-polytopes
Edward A. Bender
,
E. Rodney Canfield
Journal of Combinatorial Theory Series B
46
, 1989, pp. 58-65
An upper bound on the shortness exponent of inscribable polytopes
Michael B. Dillencourt
Journal of Combinatorial Theory Series B
46
, 1989, pp. 66-83
Minimal quadrangulations of orientable surfaces
Nora Hartsfield
,
Gerhard Ringel
Journal of Combinatorial Theory Series B
46
, 1989, pp. 84-95
The Tutte polynomial of a ported matroid
Seth Chaiken
Journal of Combinatorial Theory Series B
46
, 1989, pp. 96-117
Extending a combinatorial geometry by adding a unique line
Mark D. Halsey
Journal of Combinatorial Theory Series B
46
, 1989, pp. 118-120
Non-Hamiltonian bicubic graphs
John P. Georges
Journal of Combinatorial Theory Series B
46
, 1989, pp. 121-124
For graphs there are only four types of hereditary Ramsey classes
Jaroslav Nes̑etȓil
Journal of Combinatorial Theory Series B
46
, 1989, pp. 127-132
Chromatically optimal rigid graphs
Jaroslav Nes̑etȓil
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
46
, 1989, pp. 133-141
Hamiltonian decomposition of Cayley graphs of degree 4
J.-C. Bermond
,
O. Favaron
,
M. Maheo
Journal of Combinatorial Theory Series B
46
, 1989, pp. 142-153
Cycle covering of binary matroids
Ury Jamshy
,
Michael Tarsi
Journal of Combinatorial Theory Series B
46
, 1989, pp. 154-161
Extending cycles in directed graphs
George R.T. Hendry
Journal of Combinatorial Theory Series B
46
, 1989, pp. 162-172
A Kuratowski theorem for nonorientable surfaces
Dan Archdeacon
,
Phil Huneke
Journal of Combinatorial Theory Series B
46
, 1989, pp. 173-231
A length-width inequality for partially ordered sets with two-element cutsets
John Ginsburg
,
Bill Sands
,
Douglas B. West
Journal of Combinatorial Theory Series B
46
, 1989, pp. 232-239
On the
\Delta
-subgraph of graphs which are critical with respect to the chromatic index
A.G. Chetwynd
,
A.J.W. Hilton
,
D.G. Hoffman
Journal of Combinatorial Theory Series B
46
, 1989, pp. 240-245
The 2-matching lattice of a graph
Dieter Jungnickel
,
Matthias Leclerc
Journal of Combinatorial Theory Series B
46
, 1989, pp. 246-248
Every 7-regular digraph contains an even cycle
Shmuel Friedland
Journal of Combinatorial Theory Series B
46
, 1989, pp. 249-252
Cycle double covers of graphs with Hamilton paths
Luis A. Goddyn
Journal of Combinatorial Theory Series B
46
, 1989, pp. 253-254
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
46
, 1989, pp. 257-291
The regular matroids with no 5-wheel minor
James G. Oxley
Journal of Combinatorial Theory Series B
46
, 1989, pp. 292-305
Decomposition and optimization over cycles in binary matroids
M. Grötschel
,
K. Truemper
Journal of Combinatorial Theory Series B
46
, 1989, pp. 306-337
Seiten 1
2
>