Coloring subgraphs with restricted amounts of hues

DOI10.1515/math-2017-0098zbMath1371.05081OpenAlexW2758646072MaRDI QIDQ2406596

Robert Melville, Wayne Goddard

Publication date: 5 October 2017

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

Full work available at URL: https://doi.org/10.1515/math-2017-0098

zbMATH Keywords

rainbowvertex coloringsmonochromaticdefective

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Almost injective colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex colorings without rainbow subgraphs
• Vertex coloring without large polychromatic stars
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
• Partitioning into graphs with only small components
• Almost injective colorings
• Worm colorings
• On domination in connected cubic graphs
• 3-consecutive C-colorings of graphs
• Defective coloring revisited
• A survey of hereditary properties of graphs

This page was built for publication: Coloring subgraphs with restricted amounts of hues