Colorings of planar graphs with no rainbow faces

DOI10.1007/S00493-006-0012-3MaRDI QIDQ858112zbMATH OpenOpenAlexWikidataFDO

Authors Veselin Jungić, Daniel Král', Riste Škrekovski

Publication date 8 January 2007

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-006-0012-3

zbMATH Keywords

vertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• 2-facial 4-coloring of planar graphs with girth at least 22
• On maximum face-constrained coloring of plane graphs with no short face cycles.
• Facial rainbow coloring of plane graphs
• Maximum face-constrained coloring of plane graphs

Cited in

(15)

• On maximum face-constrained coloring of plane graphs with no short face cycles.
• Proper colorings of plane quadrangulations without rainbow faces
• Facially-constrained colorings of plane graphs: a survey
• On the balanced upper chromatic number of cyclic projective planes and projective spaces
• Null and non-rainbow colorings of projective plane and sphere triangulations
• Rainbowness of plane graphs
• The number of colorings of planar graphs with no separating triangles
• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• 2-facial 4-coloring of planar graphs with girth at least 22
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Rainbow generalizations of Ramsey theory: A survey
• Looseness of plane graphs
• Colorability of planar graphs with isolated nontriangular faces
• Rainbowness of cubic plane graphs

This page was built for publication: Colorings of planar graphs with no rainbow faces

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