Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number

DOI10.1016/j.dam.2012.05.003zbMath1252.05058arXiv0911.4199OpenAlexW1981171583MaRDI QIDQ713309

Ali Dehghan, Arash Ahadi

Publication date: 26 October 2012

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

Full work available at URL: https://arxiv.org/abs/0911.4199

zbMATH Keywords

independence numberprobabilistic method2-hued chromatic number2-hued coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On r-dynamic vertex coloring of some flower graph families ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Unnamed Item ⋮ Weak dynamic coloring of planar graphs ⋮ On \(r\)-dynamic chromatic number of graphs ⋮ On the difference between chromatic number and dynamic chromatic number of graphs ⋮ Unnamed Item ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ δ-Dynamic chromatic number of Helm graph families ⋮ On dynamic coloring of certain cycle-related graphs ⋮ Unnamed Item ⋮ \(r\)-Dynamic chromatic number of some line graphs ⋮ On r- dynamic coloring of the family of bistar graphs ⋮ On r− dynamic coloring of the gear graph families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the difference between chromatic number and dynamic chromatic number of graphs
• Dynamic list coloring of bipartite graphs
• The 2nd-order conditional 3-coloring of claw-free graphs
• On the list dynamic coloring of graphs
• Complexity of conditional colorability of graphs
• On colorings of graph powers
• Conditional colorings of graphs

This page was built for publication: Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number