![](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 104
Volume 104, January 2014
- Daniela Kühn, Deryk Osthus:
Hamilton decompositions of regular expanders: Applications. 1-27 - Zdenek Dvorák
:
3-choosability of planar graphs with ( 4)-cycles far apart. 28-59 - Jonathan Cutler, A. J. Radcliffe:
The maximum number of complete subgraphs in a graph with given maximum degree. 60-71 - Oleg V. Borodin, Alexandr V. Kostochka:
Defective 2-colorings of sparse graphs. 72-80 - Imre Bárány, János Pach:
Homogeneous selections from hyperplanes. 81-87
![](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.