Rainbowness of cubic plane graphs

DOI10.1016/j.disc.2006.06.012zbMath1109.05044OpenAlexW1977852522MaRDI QIDQ856887

Stanlislav Jendroľ

Publication date: 14 December 2006

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

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

zbMATH Keywords

independence numbervertex coloring

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Coloring of graphs and hypergraphs (05C15)

Related Items

Null and non-rainbow colorings of projective plane and sphere triangulations ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Looseness of plane graphs ⋮ Non-rainbow colorings of 3-, 4- and 5-connected plane graphs ⋮ Rainbow faces in edge‐colored plane graphs ⋮ Rainbowness of plane graphs

Cites Work

• Unnamed Item
• 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
• On maximum face-constrained coloring of plane graphs with no short face cycles.

This page was built for publication: Rainbowness of cubic plane graphs