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
[2]
Hilfe
Suche: Journal=J. Comb.~Theory Series B AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decomposition of graphs on surfaces
Maurits de Graaf
,
Alexander Schrijver
Journal of Combinatorial Theory Series B
70
(1), 1997, pp. 157-165
Tutte's edge-colouring conjecture
Neil Robertson
,
Paul Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
70
(1), 1997, pp. 166-183
Two chromatic polynomial conjectures
Paul Seymour
Journal of Combinatorial Theory Series B
70
(1), 1997, pp. 184-196
A note on graph colorings and graph polynomials
Noga Alon
,
Michael Tarsi
Journal of Combinatorial Theory Series B
70
(1), 1997, pp. 197-201
A longest cycle version of Tutte's wheels theorem
Talmage James Reid
,
Haidong Wu
Journal of Combinatorial Theory Series B
70
(1), 1997, pp. 202-215
On a clusure concept in claw-free graphs
Zdenȇk Ryjác̑ek
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 217-224
Edge-ends in countable graphs
Gen̑a Hahn
,
François Laviolette
,
Jozef S̑irán̑
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 225-244
Some theorems concerning the star chromatic number of a graph
Bing Zhou
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 245-258
Finite fields and Ramanujan graphs
J. Arias de Reyna
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 259-264
Irreducible triangulations of the Klein bottle
Serge Lawrencenko
,
Seiya Negami
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 265-291
Diagonal transformations of graphs and Dehn twists of surfaces
Atsuhiro Nakamoto
,
Katsuhiro Ota
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 292-300
Two remarks on the coloring number
Péter Komjáth
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 301-305
A simpler proof of the excluded minor theorem for higher surfaces
Carsten Thomassen
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 306-311
Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments
Stéphanie Conilh
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 312-316
On extensions of a conjecture of Gallai
André E. Kézdy
,
Hunter S. Snevily
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 317-324
The largest parity demigenus of a simple graph
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 325-345
Splitting formulas for Tutte polynomials
Artur Andrzejak
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 346-366
The Erd\Hos-Sós conjecture for graphs without
C_4
Jean-François Saclé
,
Mariusz Woźniak
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 367-372
The rank facets of the stable set polytope for claw-free graphs
A. Galluccio
,
A. Sassano
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 1-38
Convex programming and cirumference of 3-connected graphs of lowe genus
Zhicheng Gao
,
Xingxing Yu
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 39-51
The genus problem for cubic graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 52-58
Matroid valuation on independent sets
Kazuo Murota
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 59-78
Five-connected toroidal graphs are Hamiltonian
Robin Thomas
,
Xingxing Yu
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 79-96
Bridged graphs are cop-win graphs: An algorithmic proof
Victor Chepoi
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 97-100
A bound on the strong chromatic index of a graph
Michael Molloy
,
Bruce Reed
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 103-109
Seiten
<
1
2
3
>