Proper colorings of plane quadrangulations without rainbow faces

DOI10.1007/s00373-021-02350-5zbMath1479.05101OpenAlexW3171621414MaRDI QIDQ2051893

Kengo Enami, Kenta Ozeki, Tomoki Yamaguchi

Publication date: 25 November 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02350-5

zbMATH Keywords

quadrangulationloosenessanti-rainbow coloringdividing systemnon-rainbow coloring

Mathematics Subject Classification ID

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

Cites Work

• Looseness and independence number of triangulations on closed surfaces
• Colorings of planar graphs with no rainbow faces
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• Maximum face-constrained coloring of plane graphs
• Tight and untight triangulations of surfaces by complete graphs
• Facially-constrained colorings of plane graphs: a survey
• Looseness ranges of triangulations on closed surfaces
• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• On the minimum size of tight hypergraphs

This page was built for publication: Proper colorings of plane quadrangulations without rainbow faces