Journal of combinatorial theory. Series B
Clique or hole in claw-free graphs
Henning Bruhn, Akira Saito
págs. 1-13
Bandwidth theorem for random graphs
Hao Huang, Choongbum Lee, Benny Sudakov
págs. 14-37
Decomposing a graph into forests
Mickael Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu
págs. 38-52
Asymptotic normality of the size of the giant component via a random walk
Béla Bollobás, Oliver Riordan
págs. 53-61
Polyhedra with the Integer Carathéodory Property
Dion Gijswijt, Guus Regts
págs. 62-70
Clique minors in claw-free graphs
Alexandra Fradkin
págs. 71-85
Nested cycles in large triangulations and crossing-critical graphs
César Hernández-Vélez, Gervasio Salazar, Robin Thomas
págs. 86-92
Tournament immersion and cutwidth
Maria Chudnovsky, Alexandra Fradkin, Paul D. Seymour
págs. 93-101
An approximate version of the Loebl-Komlós-Sós conjecture
Diana Piguet, Maya Jakobine Stein
págs. 102-125
A-Critical graphs with small high vertex cliques
Landon Rabern
págs. 126-130
Finite dualities and map-critical graphs on a fixed surface
Jaroslav Nesetril
, Yared Nigussiepágs. 131-152
Combinatorial optimization with 2-joins
Nicolas Trotignon, Kristina Vuskovic
págs. 153-185
Packing of Steiner trees and S-connectors in graphs
Douglas B. West, Hehui Wu
págs. 186-205
On the maximum size of a minimal k-edge connected augmentation
Andrei V. Kotlov, Joseph Cheriyan
págs. 206-211
Partitioning 3-uniform hypergraphs
Jie Ma, Xingxing Yu
págs. 212-232
págs. 233-251
The structure of bull-free graphs II and III--A summary
Maria Chudnovsky
págs. 252-282
- Página 1 de 1
