![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 121
Volume 121, November 2016
- Michael Krivelevich, Bojan Mohar:
Editorial. 1 - Carolyn Chun
, Dillon Mayhew
, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids IX: The theorem. 2-67 - Alex Scott, Paul D. Seymour
:
Induced subgraphs of graphs with large chromatic number. I. Odd holes. 68-84 - Daniela Kühn, Allan Lo
, Deryk Osthus
, Katherine Staden:
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. 85-145 - Noga Alon, Clara Shikhelman:
Many T copies in H-free graphs. 146-172 - David Conlon
, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results II. 173-196 - Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorems on cycles and paths. 197-228 - Christian Reiher, Vojtech Rödl, Mathias Schacht
:
Embedding tetrahedra into quasirandom hypergraphs. 229-247 - David Saxton, Andrew Thomason:
Online containers for hypergraphs, with applications to linear equations. 248-283 - Naonori Kakimura, Ken-ichi Kawarabayashi:
Coloring immersion-free graphs. 284-307 - Carsten Thomassen
, Yezhou Wu, Cun-Quan Zhang:
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. 308-325 - Sergey Norin, Robin Thomas:
Non-planar extensions of subdivisions of planar graphs. 326-366 - Carlos Hoppen
, Nicholas C. Wormald:
Properties of regular graphs with large girth via local algorithms. 367-397 - John Maharry, Neil Robertson:
The structure of graphs not topologically containing the Wagner graph. 398-420 - Guus Regts, Alexander Schrijver, Bart Sevenster:
On partition functions for 3-graphs. 421-431 - Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Unique low rank completability of partially filled matrices. 432-462
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.