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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Oriented Hamiltonian cycles in tournaments
Frédéric Havet
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 1-31
Contractible subgraphs in 3-connected graphs
Matthias Kriesell
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 32-48
On tail distribution of interpost distance
Jeong Han Kim
,
Boris Pittel
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 49-56
On the excluded minors for quaternary matroids
J.F. Geelen
,
J.G. Oxley
,
D.L. Vertigan
,
G.P. Whittle
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 57-68
Kneser graphs are Hamiltonian for
n\ge3k
Ya-Chen Chen
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 69-79
Duality theorems for finite structures (Characterising gaps and good characterisations
Jaroslav Nes̑etȓil
,
Claude Tardif
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 80-97
A near packing of two graphs
Nancy Eaton
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 98-103
On a Hopf algebra in graph theory
Sergei K. Lando
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 104-121
Triangles and neighborhoods of independent sets in graphs
Andrew M. Robertshaw
,
Douglas R. Woodall
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 122-129
Sinks in acyclic orientations of graphs
David D. Gebhard
,
Bruce E. Sagan
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 130-146
Colored homomorphisms of colored mixed graphs
Jaroslav Nes̑etȓil
,
André Raspaud
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 147-155
On minimally
(n,\lambda)
-connected graphs
Atsushi Kaneko
,
Katsuhiro Ota
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 156-171
Unordered canonical Ramsey numbers
Duncan C. Richer
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 172-177
A characterization of graphs with no cube minor
John Maharry
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 179-201
Vertex set partitions preserving conservativeness
A.A. Ageev
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 202-217
Chromatic roots and Hamiltonian paths
C. Thomassen
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 218-224
Which crossing number is it anyway?
János Pach
,
Géza Tóth
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 225-246
Zeta functions of graph coverings
Hirobumi Mizuno
,
Iwao Sato
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 247-257
Minimal antichains in well-founded quasi-orders with an application to tournaments
Gregory L. Cherlin
,
Brenda J. Latka
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 258-276
On the dissection of rectangles into right-angled isosceles triangles
J.D. Skinner II
,
C.A.B. Smith
,
W.T. Tutte
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 277-319
Contraction-deletion invariants for graphs
Béla Bollobás
,
Luke Pebody
,
Oliver Riordan
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 320-345
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Alexander Schrijver
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 346-355
Face size and the maximum genus of a graph - 1. Simple graphs
Yuanqui Huang
,
Yanpei Liu
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 356-370
Generalized
\Delta-Y
exchange and
k
-regular matroids
James Oxley
,
Charles Semple
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
79
(1), 2000, pp. 1-65
On generalized Ramsey theory: The bipartite case
Maria Axenovich
,
Zoltán Füredi
,
Dhruv Mubayi
Journal of Combinatorial Theory Series B
79
(1), 2000, pp. 66-86
Seiten 1
2
3
>