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=90
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Balanced edge colorings
P.N. Balister
,
A. Kostochka
,
Hao Li
,
R.H. Schelp
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 3-20
Arrangements, circular arrangements and the crossing number of
C_7 \times C_n
Jay Adamsson
,
R. Bruce Richter
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 21-39
On the number of edges not covered by monochromatic copies of a fixed graph
Peter Keevash
,
Benny Sudakov
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 41-53
A new inequality for bipartite distance-regular graphs
Michael S. Lang
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 55-91
A simple competitive graph coloring algorithm II
Charles Dunn
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 93-106
Edge-disjoint odd cycles in planar graphs
Daniel Král'
,
Heinz-Jürgen Voss
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 107-120
On classifying finite edge colored graphs with two transitive automorphism groups
Thomas Q. Sibley
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 121-138
Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks
Martin Kochol
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 139-145
Homomorphisms from sparse graphs with large girth
O.V. Borodin
,
S.-J. Kim
,
A.V. Kostochka
,
D.B. West
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 147-159
On sparse graphs with given colorings and homomorphisms
Jaroslav Nes̑etȓil
,
Xuding Zhu
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 161-172
The class of binary matroids with no
M(K_{3,3})-, M^*(K_{3,3})-, M(K_5)- or M^*(K_5)
-minor
Hongxun Qin
,
Xiangqian Zhou
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 173-184
Infinitely many finite one-regular graphs of any even valency
Jin Ho Kwak
,
Ju-Mok Oh
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 185-191
Hamiltonian decompositions of random bipartite regular graphs
Catherine Greenhill
,
Jeong Han Kim
,
Nicholas C. Wormald
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 195-222
Geometric realisation of the graphs of McKay-Miller-Siran
Paul R. Hafner
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 223-232
Weakly distance-regular digraphs
F. Comellas
,
M.A. Fiol
,
J. Gimbert
,
M. Mitjana
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 233-255
Square-free perfect graphs
Michele Conforti
,
Gérard Cornuéjols
,
Kristina Vus̑ković
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 257-307
Bounded degree acyclic decompositions of digraphs
David R. Wood
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 309-313
Cycles through a prescribed vertex set in
N
-connected graphs
Ken-ichi Kawarabayashi
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 315-323
Graph minors. XIX. Well-quasi-ordering on a surface
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 325-385