On maximum face-constrained coloring of plane graphs with no short face cycles.

DOI10.1016/j.disc.2003.08.001zbMath1034.05023WikidataQ57601591 ScholiaQ57601591MaRDI QIDQ1426126

Daniel Král'

Publication date: 14 March 2004

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

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

zbMATH Keywords

planar graph; coloring; planar hypergraph; polychromatic face

Mathematics Subject Classification ID

05C65: Hypergraphs

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

Related Items

Rainbowness of cubic plane graphs, Rainbowness of plane graphs, Non-rainbow colorings of 3-, 4- and 5-connected plane graphs, Rainbow faces in edge‐colored plane graphs

Cites Work

• On restricted colourings of \(K_ n\)
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• Edge-colorings of complete graphs that avoid polychromatic trees
• Maximum face-constrained coloring of plane graphs
• Colouring planar mixed hypergraphs
• 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
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• Gaps in the chromatic spectrum of face-constrained plane graphs
• On planar mixed hypergraphs