![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 165
Volume 165, March 2024
- Shagnik Das, Nemanja Draganic
, Raphael Steiner
:
Tight bounds for divisible subdivisions. 1-19 - Bill Jackson
, Shin-ichi Tanigawa:
Maximal matroids in weak order posets. 20-46 - On-Hei Solomon Lo
, Jens M. Schmidt
:
Generalized cut trees for edge-connectivity. 47-67 - Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
:
Edge-colouring graphs with local list sizes. 68-96 - Matías Pavez-Signé, Nicolás Sanhueza-Matamala
, Maya Stein:
Dirac-type conditions for spanning bounded-degree hypertrees. 97-141 - Sepehr Hajebi
, Yanjia Li, Sophie Spirkl
:
Hitting all maximum stable sets in P5-free graphs. 142-163 - Jakub Kozik, Piotr Micek, William T. Trotter:
Dimension is polynomial in height for posets with planar cover graphs. 164-196 - Yan Wang, Hehui Wu
:
Graph partitions under average degree constraint. 197-210 - Tung Nguyen, Alex D. Scott
, Paul D. Seymour:
On a problem of El-Zahar and Erdős. 211-222
- Noga Alon
, Peter Frankl:
Turán graphs with bounded matching number. 223-229
![](https://dblp.dagstuhl.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.