Colorability of planar graphs with isolated nontriangular faces

DOI10.1007/S00373-004-0574-ZzbMATH Open1055.05047OpenAlexW1969310879MaRDI QIDQ704852FDOQ704852

Authors: M. N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger 

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

Recommendations

• Colorings of planar graphs with no rainbow faces
• Colouring vertices of plane graphs under restrictions given by faces
• Coloring vertices and faces of locally planar graphs
• Facial entire colouring of plane graphs
• scientific article; zbMATH DE number 1367494
• Facial nonrepetitive vertex coloring of plane graphs
• Coloring of plane graphs with unique maximal colors on faces
• Colorings of plane graphs without long monochromatic facial paths
• Facial non-repetitive edge-coloring of plane graphs
• scientific article

zbMATH Keywords

Eulerian triangulation3-ColoringHole graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Further extensions of the Grötzsch theorem
• 3-colorability of pseudo-triangulations
• Note on 3-choosability of planar graphs with maximum degree 4
• Coloring vertices and faces of locally planar graphs
• Three colorability characterized by shrinking of locally connected subgraphs into triangles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704852)