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=101
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Max-Flow Min-Cut theorem for countable networks
Ron Aharoni
,
Eli Berger
,
Agelos Georgakopoulos
,
Amitai Perlstein
,
Philipp Sprüssel
Journal of Combinatorial Theory Series B
101
(1), 2011, pp. 1-17
The edge-density for
K_{2,t}
minors
Maria Chudnovsky
,
Bruce Reed
,
Paul Seymour
Journal of Combinatorial Theory Series B
101
(1), 2011, pp. 18-46
A well-quasi-order for tournaments
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
101
(1), 2011, pp. 47-53
Non-separating subgraphs after deleting many disjoint paths
Ken-ichi Kawarabayashi
,
Kenta Ozeki
Journal of Combinatorial Theory Series B
101
(1), 2011, pp. 54-59
Twins of rayless graphs
Anthony Bonato
,
Henning Bruhn
,
Reinhard Diestel
,
Philipp Sprüssel
Journal of Combinatorial Theory Series B
101
(1), 2011, pp. 60-65
The fine structure of octahedron-free graphs
József Balogh
,
Béla Bollobás
,
Miklós Simonovits
Journal of Combinatorial Theory Series B
101
(2), 2011, pp. 67-84
The structure of almost all graphs in a hereditary property
Noga Alon
,
József Balogh
,
Béla Bollobás
,
Robert Morris
Journal of Combinatorial Theory Series B
101
(2), 2011, pp. 85-110
Large non-planar graphs and an application to crossing-critical graphs
Guoli Ding
,
Bogdan Oporowski
,
Robin Thomas
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
101
(2), 2011, pp. 111-121
Linked tree-decompositions of represented infinite matroids
Jeffrey Azzato
Journal of Combinatorial Theory Series B
101
(3), 2011, pp. 123-140
A chain theorem for internally 4-connected binary matroids
Carolyn Chun
,
Dillon Mayhew
,
James Oxley
Journal of Combinatorial Theory Series B
101
(3), 2011, pp. 141-189
Classification of nonorientable regular embeddings of complete bipartite graphs
Jin Ho Kwak
,
Young Soo Kwon
Journal of Combinatorial Theory Series B
101
(4), 2011, pp. 191-205
The 2-extendability of 5-connected graphs on surfaces with large representativity
Ken-ichi Kawarabayashi
,
Seiya Negami
,
Michael D. Plummer
,
Yusuke Suzuki
Journal of Combinatorial Theory Series B
101
(4), 2011, pp. 206-213
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Mark Bilinski
,
Bill Jackson
,
Jie Ma
,
Xingxing Yu
Journal of Combinatorial Theory Series B
101
(4), 2011, pp. 214-236
Small subgraphs in random graphs and the power of multiple choices
Torsten Mütze
,
Reto Spöhel
,
Henning Thomas
Journal of Combinatorial Theory Series B
101
(4), 2011, pp. 237-268
Finitely forcible graphons
L. Lovász
,
B. Szegedy
Journal of Combinatorial Theory Series B
101
(5), 2011, pp. 269-301
Contraction obstructions for treewidth
Fedor V. Fomin
,
Petr Golovach
,
Dimitrios M. Thilikos
Journal of Combinatorial Theory Series B
101
(5), 2011, pp. 302-314
Counting colored planar maps: Algebraicity results
Olivier Bernardi
,
Mireille Bousquet-Mélou
Journal of Combinatorial Theory Series B
101
(5), 2011, pp. 315-377
Packing cycles through prescribed vertices
Naonori Kakimura
,
Ken-ichi Kawarabayashi
,
Dániel Marx
Journal of Combinatorial Theory Series B
101
(5), 2011, pp. 378-381
Fractional total colourings of graphs of high girth
Tomás̑ Kaiser
,
Andrew King
,
Daniel Král'
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 383-402
On two generalizations of the Alon-Tarsi polynomial method
Hefetz Dan
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 403-414
An approximate version of Sumner's universal tournament conjecture
Daniela Kühn
,
Richard Mycroft
,
Deryk Osthus
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 415-447
Unexpected behaviour of crossing sequences
Matt DeVos
,
Bojan Mohar
,
Robert S̑ámal
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 448-463
Circular flow on signed graphs
Andre Raspaud
,
Xuding Zhu
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 464-479
Longest cycles in
k
-connected graphs with given independence number
Suil O
,
Douglas B. West
,
Hehui Wu
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 480-485
An odd characterization of the generalized odd graphs
Edwin R. van Dam
,
Willem H. Haemers
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 486-489
Seiten 1
2
>