Every planar 1-ended graph has a periodic proper vertex coloring; Euclidean ones use at most 5 colors.
Title resolution pending
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
-
Planar 1-ended graphs can be periodically coloured
Every planar 1-ended graph has a periodic proper vertex coloring; Euclidean ones use at most 5 colors.