Vertex coloring without large polychromatic stars

DOI10.1016/J.DISC.2011.04.013zbMath1244.05088OpenAlexW2081018322WikidataQ59072599 ScholiaQ59072599MaRDI QIDQ432703

Charles Dominic, E. Sampathkumar, Zsolt Tuza, Csilla Bujtás, L. Pushpa Latha

Publication date: 4 July 2012

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

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

zbMATH Keywords

graph coloringvertex coloringupper chromatic number\(C\)-coloringlocal condition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Neighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ Vertex colorings without rainbow subgraphs ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ Coloring subgraphs with restricted amounts of hues ⋮ Maximum number of colors: C-coloring and related problems ⋮ WORM colorings of planar graphs ⋮ Worm colorings ⋮ Improved bounds for some facially constrained colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Improper C-colorings of graphs
• The neighbourhood number of a graph
• Parallel concepts in graph theory
• 3-consecutive C-colorings of graphs

This page was built for publication: Vertex coloring without large polychromatic stars