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=85
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding digraphs on orientable surfaces
C. Paul Bonnington
,
Marston Conder
,
Margaret Morton
,
Patricia McKenna
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 1-20
Generating internally four-connected graphs
Thor Johnson
,
Robin Thomas
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 21-58
Optimal ear decompositions of matching covered graphs and bases for the matching lattice
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 59-93
On a conjecture of Lovász concerning bricks - I. The characteristic of a matching covered graph
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 94-136
On a conjecture of Lovász concerning bricks - II. Bricks of finite characteristics
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 137-180
Distance graphs with finite chromatic number
I.Z. Ruzsa
,
Zs. Tuza
,
M. Voigt
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 181-187
Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
Richard A. Brualdi
,
Jian Shen
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 189-196
Products of circulant graphs are metacirculant
Robin S. Sanders
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 197-206
Contractible edges and triangles in
k
-connected graphs
Ken-ichi Kawarabayashi
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 207-221
Proof of a conjecture of Bollobás and Kohayakawa on the Erd\Hos-Stone theorem
Yoshiyasu Ishigami
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 222-254
A short proof of Guenin's characterization of weakly bipartite graphs
Alexander Schrijver
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 255-260
Evaluations of the circuit partition polynomial
Béla Bollobás
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 261-268
Families of regular graphs in regular maps
Steve Wilson
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 269-289
Fair Hamilton decompositions of complete multipartite graphs
C.D. Leach
,
C.A. Rodger
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 290-296
On the density of identifying codes in the square lattice
Iiro Honkala
,
Antoine Lobstein
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 297-306
Coloring face-hypergraphs of graphs on surfaces
André Kündgen
,
Radhika Ramamurthi
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 307-337
Long cycles in graphs on a fixed surface
Thomas Böhme
,
Bojan Mohar
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 338-347
Coloring the faces of convex polyhedra so that like colors are far apart
Daniel P. Sanders
,
Yue Zhao
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 348-360
Anti-Ramsey numbers of subdivided graphs
Tao Jiang
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 361-366