Maximum face-constrained coloring of plane graphs

DOI10.1016/J.DISC.2003.09.001MaRDI QIDQ1421525zbMATH OpenOpenAlexFDO

Authors Radhika Ramamurthi, Douglas B. West

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)

Recommendations

• On maximum face-constrained coloring of plane graphs with no short face cycles.
• Unique-maximum coloring of plane graphs
• Colouring vertices of plane graphs under restrictions given by faces
• Cyclic coloring of plane graphs
• Coloring of plane graphs with unique maximal colors on faces

Cites work

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

Cited in

(20)

• Planar anti-Ramsey numbers of matchings
• Vertex colorings without rainbow subgraphs
• Colouring vertices of plane graphs under restrictions given by faces
• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• Unique-maximum edge-colouring of plane graphs with respect to faces
• Proper colorings of plane quadrangulations without rainbow faces
• Planar anti-Ramsey numbers of paths and cycles
• On maximum face-constrained coloring of plane graphs with no short face cycles.
• Embeddings of a graph into a surface with different weak chromatic numbers
• Facially-constrained colorings of plane graphs: a survey
• Improved bounds for some facially constrained colorings
• Coloring the faces of convex polyhedra so that like colors are far apart
• Gaps in the chromatic spectrum of face-constrained plane graphs
• Looseness of plane graphs
• Rainbowness of plane graphs
• Colorings of planar graphs with no rainbow faces
• Rainbowness of cubic plane graphs
• Null and non-rainbow colorings of projective plane and sphere triangulations
• A note on polychromatic colorings of plane graphs
• Rainbow faces in edge-colored plane graphs

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

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