Maximum face-constrained coloring of plane graphs

DOI10.1016/j.disc.2003.09.001zbMath1032.05050OpenAlexW2155851327MaRDI QIDQ1421525

Douglas B. West, Radhika Ramamurthi

Publication date: 26 January 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.09.001

zbMATH Keywords

ColoringPlanar graphPolychromatic

Mathematics Subject Classification ID

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

Related Items (14)

Null and non-rainbow colorings of projective plane and sphere triangulations ⋮ Rainbowness of cubic plane graphs ⋮ Vertex colorings without rainbow subgraphs ⋮ Embeddings of a graph into a surface with different weak chromatic numbers ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Planar anti-Ramsey numbers of matchings ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ Looseness of plane graphs ⋮ Non-rainbow colorings of 3-, 4- and 5-connected plane graphs ⋮ Proper colorings of plane quadrangulations without rainbow faces ⋮ Rainbow faces in edge‐colored plane graphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ Unique-maximum edge-colouring of plane graphs with respect to faces ⋮ Rainbowness of plane graphs

Cites Work

• On restricted colourings of \(K_ n\)
• Planar Ramsey numbers
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• Edge-colorings with no large polychromatic stars
• Coloring face-hypergraphs of graphs on surfaces
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• HYPERGRAPHS
• Every planar map is four colorable
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum face-constrained coloring of plane graphs