Author:
Dvořák Zdeněk,Moore Benjamin,Seifrtová Michaela,Šámal Robert
Abstract
We consider the 4-precoloring extension problem in \emph{planar near-Eulerian- triangulations}, i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even degree, and exactly the vertices incident with the outer face are precolored. We give a necessary topological condition for the precoloring to extend, and give a complete characterization when the outer face has length at most five and when all vertices of the outer face have odd degree and are colored using only three colors.
Reference24 articles.
1. Kennth Appel and Wolfgang Haken. Every planar map is four colorable. Part I: Discharging. Illinois Journal of Mathematics, 21(3):429-490, 1977.
2. Zdenek Dvorak, Daniel Kral' and Robin Thomas. Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. ArXiv, 1509.01013, September 2015.
3. Zdenek Dvorak, Daniel Kral', and Robin Thomas. Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. Journal of Combinatorial Theory, Series B, 145:376-432, 2020.
4. Zdenek Dvorak, Daniel Kral', and Robin Thomas. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. Journal of combinatorial Theory, Series B, 150:270-304, 2021.
5. Zdenek Dvorak, Daniel Kral', and Robin Thomas. Three-coloring triangle-free graphs on surfaces VII. A linear time algorithm. Journal of Combinatorial Theory, Series B, 152:483-504, 2022.