K6 minors in large6-connected graphs of bounded treewidth.J

Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan · 2019

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

The Dominating 4-Colour Theorem

math.CO · 2026-05-11 · unverdicted · novelty 7.0

Every graph with no dominating K5-model is 4-colorable.

citing papers explorer

Showing 1 of 1 citing paper.

The Dominating 4-Colour Theorem math.CO · 2026-05-11 · unverdicted · none · ref 14
Every graph with no dominating K5-model is 4-colorable.