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 YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
High-girth graphs avoiding a minor are nearly bipartite
Anna Galluccio
,
Luis A. Goddyn
,
Pavol Hell
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 1-14
Matroid 4-connectivity: A deletion-contraction theorem
James Geelen
,
Geoff Whittle
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 15-37
Flexibility of polyhedral embeddings of graphs in surfaces
Bojan Mohar
,
Neil Robertson
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 38-57
Graph imperfection
Stefanie Gerke
,
Colin McDiarmid
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 58-78
Graph imperfection II
Stefanie Gerke
,
Colin Mc Diarmid
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 79-101
A new bound on the cyclic chromatic number
Daniel P. Sanders
,
Yue Zhao
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 102-111
A characterization of weakley bipartite graphs
Bertrand Guenin
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 112-168
About skew partitions in minimal imperfect graphs
F. Roussel
,
P. Rubio
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 171-190
Dynamic monopolies of constant size
Eli Berger
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 191-200
Planar graphs of maximum degree seven are class I
Daniel P. Sanders
,
Yue Zhao
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 201-212
Partitioning vertices of a tournament into independent cycles
Guantao Chen
,
Ronald J. Gould
,
Hao Li
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 213-220
On a conjecture about trees in graphs with large girth
Tao Jiang
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 221-232
On the spectral radius of graphs with cut vertices
Abraham Berman
,
Xiao-Dong Zhang
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 233-240
Choosability in random hypergraphs
Michael Krivelevich
,
Van H. Vu
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 241-257
An equivalent version of the 3-flow conjecture
Martin Kochol
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 258-261
Decomposing a planar graph into an independent set and a 3-degenerate graph
Carsten Thomassen
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 262-271
On the chromatic roots of generalized theta graphs
Jason I. Brown
,
Carl Hickman
,
Alan D. Sokal
,
David G. Wagner
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 272-297
Irreducibility of the Tutte polynomial of a connected matroid
C. Merino
,
A. de Mier
,
M. Noy
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 298-304
Almost all 3-connected graphs contain a contractible set of
k
vertices
Matthias Kriesell
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 305-319
A transformation which preserves the clique number
Michael U. Gerber
,
Alain Hertz
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 320-330
Covering a strong digraph by
\alpha-1
disjoint paths: A proof of Las Vergnas' conjecture
Stéphan Thomassé
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 331-333
Anti-Ramsey colorings in several rounds
Aart Blokhuis
,
Ralph Faudree
,
András Gyárfás
,
Miklós Ruszinkó
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 1-18
A matrix method for chromatic polynomials
Norman Biggs
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 19-29
Fragmentability of graphs
Keith Edwards
,
Graham Farr
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 30-37
Line graphs and forbidden induced subgraphs
Hong-Jian Lai
,
L̑ubomír S̑oltés
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 38-55
Seiten 1
2
3
>