Every graph with no dominating K5-model is 4-colorable.
Über eine Klassifikation der Streckenkomplexe.Vierteljschr
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Dominating 4-Colour Theorem
Every graph with no dominating K5-model is 4-colorable.