![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 105
Volume 105, March 2014
- Christian Reiher:
Counting odd cycles in locally dense graphs. 1-5
- Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason
, Piotr Micek, William T. Trotter, Bartosz Walczak
:
Triangle-free intersection graphs of line segments with large chromatic number. 6-10 - Maria Chudnovsky
, Paul D. Seymour
:
Extending the Gyárfás-Sumner conjecture. 11-16 - Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti:
Packing of rigid spanning subgraphs and spanning trees. 17-25 - Jialong Cheng, Sitharam Meerea:
Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid. 26-43 - Maria Chudnovsky
, Paul D. Seymour
:
Rao's degree sequence conjecture. 44-92 - Florian Lehner
:
On spanning tree packings of highly edge connected graphs. 93-126
![](https://dblp.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.