A new proof of 3-colorability of Eulerian triangulations

DOI10.26493/1855-3974.193.8e7zbMath1236.05070OpenAlexW2149754020WikidataQ129353438 ScholiaQ129353438MaRDI QIDQ3119059

Douglas B. West, Mu-Tsun Tsai

Publication date: 7 March 2012

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.193.8e7

zbMATH Keywords

3-colorableHeawood's theoremplane triangulation, eulerian circuit

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Facial list colourings of plane graphs ⋮ Positive planar satisfiability problems under 3-connectivity constraints ⋮ \(N\)-flips in triangulations with two odd degree vertices ⋮ Unnamed Item ⋮ TSP Tours in Cubic Graphs: Beyond 4/3 ⋮ Facial achromatic number of triangulations on the sphere ⋮ Stable broken $H^1$ and $H(\mathrm {div})$ polynomial extensions for polynomial-degree-robust potential and flux reconstruction in three space dimensions ⋮ Achromatic number and facial achromatic number of connected locally-connected graphs ⋮ The existence of uniform hypergraphs for which the interpolation property of complete coloring fails ⋮ Extension to 3-Colorable Triangulations

This page was built for publication: A new proof of 3-colorability of Eulerian triangulations