A Note on $4$-colorings of Quadrangulations
Arthur Hoffmann-Ostenhof, Atsuhiro Nakamoto

TL;DR
This paper proves that in any quadrangulation on an orientable surface with a proper 4-coloring, the number of faces with a specific boundary color order equals the number with the reverse order, implying an even count of rainbow-faces.
Contribution
It establishes a symmetry property of rainbow faces in quadrangulations, revealing that the count of faces with reversed boundary color sequences are equal.
Findings
Number of (c1,c2,c3,c4)-faces equals the number of (c4,c3,c2,c1)-faces.
Number of rainbow-faces in G is even.
Symmetry property holds for faces with specific boundary color sequences.
Abstract
Let be a quadrangulation on an orientable surface and let be a proper vertex--coloring of . A face of is said to be a rainbow-face if all four distinct colors appear on its boundary. A -face in is a rainbow face with colors , on the boundary in clockwise order. We show that the number of -faces in equals the number of -faces. This implies in particular that the number of rainbow-faces of is even.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
