Colorability of planar graphs with isolated nontriangular faces

DOI10.1007/s00373-004-0574-zzbMath1055.05047OpenAlexW1969310879MaRDI QIDQ704852

Herbert Fleischner, Martin Kochol, Emanuel Wenger, Mark N. Ellingham

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0574-z

zbMATH Keywords

Eulerian triangulation3-ColoringHole graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Further extensions of the Grötzsch theorem ⋮ Three colorability characterized by shrinking of locally connected subgraphs into triangles ⋮ 3-Colorability of Pseudo-Triangulations ⋮ Note on 3-choosability of planar graphs with maximum degree 4

This page was built for publication: Colorability of planar graphs with isolated nontriangular faces