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=102
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Clique or hole in claw-free graphs
Henning Bruhn
,
Akira Saito
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 1-13
Bandwidth theorem for random graphs
Hao Huang
,
Choongbum Lee
,
Benny Sudakov
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 14-37
Decomposing a graph into forests
Mickael Montassier
,
Patrice Ossona de Mendez
,
André Raspaud
,
Xuding Zhu
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 38-52
Asymptotic normality of the size of the giant component via a random walk
Béla Bollobás
,
Oliver Riordan
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 53-61
Polyhedra with the Integer Carathéodory Property
Dion Gijswijt
,
Guus Regts
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 62-70
Clique minors in claw-free graphs
Alexandra Fradkin
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 71-85
Nested cycles in large triangulations and crossing-critical graphs
César Hernández-Vélez
,
Gelasio Salazar
,
Robin Thomas
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 86-92
Tournament immersion and cutwidth
Maria Chudnovsky
,
Alexandra Fradkin
,
Paul Seymour
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 93-101
An approximate version of the Loebl-Komlós-Sós conjecture
Diana Piguet
,
Maya Jakobine Stein
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 102-125
\Delta
-critical graphs with small high vertex cliques
Landon Rabern
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 126-130
Finite dualities and map-critical graphs on a fixed surface
Jaroslav Nes̑etȓil
,
Yared Nigussie
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 131-152
Combinatorial optimization with 2-joins
Nicolas Trotignon
,
Kristina Vus̑ković
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 153-185
Packing of Steiner trees and
S
-connectors in graphs
Douglas B. West
,
Hehui Wu
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 186-205
On the maximum size of a minimal
k
-edge connected augmentation
Andre V. Kotlov
,
Joseph Cheriyan
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 206-211
Partitioning 3-uniform hypergraphs
Jie Ma
,
Xingxing Yu
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 212-232
The structure of bull-free graphs I - Three-edge-paths with centers and anticenters
Maria Chudnovsky
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 233-251
The structure of bull-free graphs II and III - A summary
Maria Chudnovsky
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 252-282
On the 1-chromatic number of nonorientable surfaces with large genus
Vladimir P. Korzhik
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 283-328
Stationary distribution and cover time of random walks on random digraphs
Colin Cooper
,
Alan Frieze
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 329-362
Three-colourable perfect graphs without even pairs
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 363-394
Approximate multipartite version of the Hajnal-Szemerédi theorem
Béla Csaba
,
Marcelo Mydlarz
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 395-410
Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
Bodo Lass
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 411-423
The disjoint paths problem in quadratic time
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
,
Bruce Reed
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 424-435
On some Tutte polynomial sequences in the square lattice
Arun P. Mani
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 436-453
The Erdŏs-Pósa property for clique minors in highly connected graphs
Reinhard Diestel
,
Ken-ichi Kawarabayashi
,
Paul Wollan
Journal of Combinatorial Theory Series B
102
(2), 2012, pp. 454-469
Seiten 1
2
3
>