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=87
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Blocking nonorientability of a surface
Bojan Mohar
,
Alexander Schrijver
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 2-16
Non-separable detachments of graphs
Bill Jackson
,
Tibor Jordán
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 17-37
The chromatic number of a graph of girth 5 on a fixed surface
Carsten Thomassen
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 38-71
On a lemma of Scarf
Ron Aharoni
,
Tamás Fleiner
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 72-80
Hamiltonian double Latin squares
A.J.W. Hilton
,
M. Mays
,
C.A. Rodger
,
C.St.J.A. Nash-Williams
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 81-129
On immersions of uncountable graphs
Thomas Andreae
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 130-137
2-factor Hamiltonian graphs
M. Funk
,
Bill Jackson
,
D. Labbate
,
J. Sheehan
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 138-144
The countable Erd\Hos-Menger conjecture with ends
Reinhard Diestel
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 145-161
On 2-arc-transitivity of Cayley graphs
Dragan Marus̑ic̑
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 162-196
Graph-theoretical versus topological ends of graphs
Reinhard Diestel
,
Daniela Kühn
Journal of Combinatorial Theory Series B
87
(1), 2003, pp. 197-206
The independence fractal of a graph
J.I. Brown
,
C.A. Hickman
,
R.J. Nowakowski
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 209-230
Partitioning into graphs with only small components
Noga Alon
,
Guoli Ding
,
Bogdan Oporowski
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 231-243
Packing cycles in graphs, II
Guoli Ding
,
Zhenzhen Xu
,
Wenan Zang
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 244-253
Coloring edges of graphs embedded in a surface of characteristic zero
Daniel P. Sanders
,
Yue Zhao
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 254-263
Cliques in dense
GF(q)
-representable matroids
James Geelen
,
Geoff Whittle
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 264-269
Disjoint cocircuits in matroids with large rank
James F. Geelen
,
A.M.H. Gerards
,
Geoff Whittle
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 270-279
Ramsey numbers involving large dense graphs and bipartite Turán numbers
Yusheng Li
,
Wenan Zang
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 280-288
Every strong digraph has a spanning strong subgraph with at most
n+2\alpha-2
arcs
Stéphane Bessy
,
Stéphan Thomassé
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 289-299
Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
Michele Conforti
,
Gérard Cornuéjols
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 300-330
A class of perfect graphs containing
P_6
Gérard Cornuéjols
,
Xinming Liu
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 331-347
Bounds for mean colour numbers of graphs
F.M. Dong
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 348-365
Graphs with large maximum degree containing no odd cycles of a given length
Paul Balister
,
Béla Bollobás
,
Oliver Riordan
,
Richard H. Schelp
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 366-373
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
Alexandr V. Kostochka
,
Michael Stiebitz
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 374-402