


default search action
Journal of Combinatorial Theory, Series B, Volume 144
Volume 144, September 2020
- Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Jie Han:

The number of Gallai k-colorings of complete graphs. 1-13 - Jie Han, Yi Zhao:

Hamiltonicity in randomly perturbed hypergraphs. 14-31 - Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová, Robert Sámal

:
3-Flows with large support. 32-80 - Peter Frankl:

Maximum degree and diversity in intersecting hypergraphs. 81-94 - Fiachra Knox, Bojan Mohar:

Maximum number of colourings: 4-chromatic graphs. 95-118 - Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:

The hat guessing number of graphs. 119-149 - Matija Bucic

, Erik Jahn, Alexey Pokrovskiy
, Benny Sudakov:
2-factors with k cycles in Hamiltonian graphs. 150-166 - János Pach, István Tomon:

On the chromatic number of disjointness graphs of curves. 167-190 - Tomás Kaiser

, Matej Stehlík:
Edge-critical subgraphs of Schrijver graphs. 191-196 - Dawei He, Yan Wang, Xingxing Yu:

The Kelmans-Seymour conjecture I: Special separations. 197-224 - Dawei He, Yan Wang, Xingxing Yu:

The Kelmans-Seymour conjecture II: 2-Vertices in K4-. 225-264 - Dawei He, Yan Wang, Xingxing Yu:

The Kelmans-Seymour conjecture III: 3-vertices in K4-. 265-308 - Dawei He, Yan Wang, Xingxing Yu:

The Kelmans-Seymour conjecture IV: A proof. 309-358

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














