![](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 118
Volume 118, May 2016
- Maria Chudnovsky
, Ringi Kim
, Sang-il Oum
, Paul D. Seymour
:
Unavoidable induced subgraphs in large graphs with no homogeneous sets. 1-12 - Andrew Treglown:
A degree sequence Hajnal-Szemerédi theorem. 13-43 - Bertrand Guenin, Irene Pivotto, Paul Wollan:
Stabilizer theorems for even cycle matroids. 44-75 - Robin Thomas, Peter Whalen:
Odd K3, 3 subdivisions in bipartite graphs. 76-87 - Stefan Glock, Daniela Kühn, Deryk Osthus:
Optimal path and cycle decompositions of dense quasirandom graphs. 88-108 - Maria Chudnovsky
, Alex Scott, Paul D. Seymour
:
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. 109-128 - Ron Aharoni
, Daniel Kotlar
, Ran Ziv:
Rainbow sets in the intersection of two matroids. 129-136 - Codrut Grosu:
On the algebraic and topological structure of the set of Turán densities. 137-185 - David Forge, Thomas Zaslavsky:
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs. 186-227 - Laura Mancinska, David E. Roberson
:
Quantum homomorphisms. 228-267 - Johannes Carmesin
, Reinhard Diestel, M. Hamann, Fabian Hundertmark:
Canonical tree-decompositions of finite graphs II. Essential parts. 268-283
- Donald K. Wagner:
A circuit characterization of graphic matroids. 284-290
![](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.