Colorings of planar graphs with no rainbow faces

DOI10.1007/S00493-006-0012-3zbMATH Open1174.05364OpenAlexW2000703413WikidataQ57601528 ScholiaQ57601528MaRDI QIDQ858112FDOQ858112

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

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

zbMATH Keywords

vertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (15)

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

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)