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=84
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
One or two disjoint circuits cover independent edges - Lovász-Woodall conjecture
Ken-ichi Kawarabayashi
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 1-44
Patch colorings and rigid colorings of the rational
n
-space
Grzegorz Kubicki
,
Jenŏ Lehel
,
Michaƚ Morayne
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 45-53
Subgraph coverings and edge switchings
Genghua Fan
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 54-83
The number of loopless 4-regular maps on the projective plane
Han Ren
,
Yanpei Liu
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 84-99
On essential and inessential polygons in embedded graphs
R. Bruce Richter
,
R.P. Vitray
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 100-117
Three moves on signed surface triangulations
Shalom Eliahou
,
Sylvain Gravier
,
Charles Payan
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 118-125
How many steps are necessary to separate a bigraph?
Nicole Portmann
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 126-129
Totally free expansions of matroids
James Geelen
,
James Oxley
,
Dirk Vertigan
,
Geoff Whittle
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 130-179
The numbers of dependent
k
-sets in a graph are log concave
David G.C. Horrocks
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 180-185
Distribution of cycle lengths in graphs
Genghua Fan
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 187-202
A fully combinatorial algorithm for submodular function minimization
Satoru Iwata
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 203-212
Odd wheels in graphs
Baoguang Xu
,
Guoping Jin
,
Zhenhong Liu
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 213-224
Colouring Eulerian triangulations
Joan Hutchinson
,
R. Bruce Richter
,
Paul Seymour
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 225-239
Vertex Ramsey properties of families of graphs
Tomasz Łuczak
,
Andrzej Ruciński
,
Sebastian Urbański
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 240-248
Disconnected 2-factors in planar cubic bridgeless graphs
Ajit A. Diwan
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 249-259
Polynomials associated with nowhere-zero flows
Martin Kochol
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 260-269
Branch-width and well-quasi-ordering in matroids and graphs
James F. Geelen
,
A.M.H. Gerards
,
Geoff Whittle
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 270-290
Labeled
K_{2,t}
minors in plane graphs
Thomas Böhme
,
Bojan Mohar
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 291-300
Coloring locally bipartite graphs on surfaces
Bojan Mohar
,
Paul D. Seymour
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 301-310
Graphs with magnetic Schrödinger operators of low corank
Hein van der Holst
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 311-339
A continuous analogue of the girth problem
Alon Amit
,
Shlomo Hoory
,
Nathan Linial
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 340-363
On the parity of colourings and flows
Andrew J. Goodall
,
Dominic J.A. Welsh
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 364-365