![](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 152
Volume 152, January 2022
- Johannes Carmesin
, Matthias Hamann, Babak Miraftab:
Canonical trees of tree-decompositions. 1-26 - Chun-Hung Liu, David R. Wood:
Clustered variants of Hajós' conjecture. 27-54 - Robert Jajcay, Primoz Potocnik, Steve Wilson:
On the Cayleyness of Praeger-Xu graphs. 55-79 - Carolyn Chun, James G. Oxley, Kristen Wetzler:
The binary matroids with no odd circuits of size exceeding five. 80-120 - Nathan Kahl:
Extremal graphs for the Tutte polynomial. 121-152 - Andrew Vince
:
A lower bound on the average size of a connected vertex set of a graph. 153-170 - Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic
:
Triangle resilience of the square of a Hamilton cycle in random graphs. 171-220 - Anita Liebenau
, Rajko Nenadov
:
The threshold bias of the clique-factor game. 221-247 - Tara Abrishami, Maria Chudnovsky
, Cemil Dibek
, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Graphs with polynomially many minimal separators. 248-280 - Peter Keevash, Katherine Staden:
The generalised Oberwolfach problem. 281-318 - Anton Bernshteyn:
A fast distributed algorithm for (Δ + 1)-edge-coloring. 319-352 - Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. 353-378 - Long-Tu Yuan:
Extremal graphs for edge blow-up of graphs. 379-398 - Binlong Li, Jie Ma
, Bo Ning
:
Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles. 399-414 - Seyyed Aliasghar Hosseini, Bojan Mohar
, Mohammad Bagher Ahmadi:
The evolution of the structure of ABC-minimal trees. 415-452 - Tomás Kaiser, Matej Stehlík:
Edge-critical subgraphs of Schrijver graphs II: The general case. 453-482 - Zdenek Dvorák
, Daniel Král'
, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. 483-504
![](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.