Proper colorings of plane quadrangulations without rainbow faces

DOI10.1007/S00373-021-02350-5MaRDI QIDQ2051893zbMATH OpenOpenAlexFDO

Authors 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

anti-rainbow coloringdividing systemloosenessnon-rainbow coloringquadrangulation

Mathematics Subject Classification ID

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

Recommendations

• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• Colorings of planar graphs with no rainbow faces
• Rainbow faces in edge-colored plane graphs
• Rainbowness of plane graphs
• Matchings and nonrainbow colorings

Cites work

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

Cited in

(1)

• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs

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

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