On indicated coloring of graphs

DOI10.1007/s00373-014-1508-zzbMath1328.05154OpenAlexW2044426942MaRDI QIDQ897289

R. Pandiya Raj, H. P. Patil, S. Francis Raj

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1508-z

zbMATH Keywords

chordal graphscographsindicated chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

On indicated chromatic number of graphs ⋮ On indicated coloring of lexicographic product of graphs ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ Indicated coloring game on Cartesian products of graphs ⋮ On indicated coloring of some classes of graphs ⋮ On game chromatic vertex-critical graphs

Cites Work

• Unnamed Item
• Paw-free graphs
• Complement reducible graphs
• Dominating cliques in \(P_ 5\)-free graphs
• On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
• Some results on maximum stable sets in certain \(P_{5}\)-free graphs
• (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
• On (\(P_{5}\), diamond)-free graphs
• Indicated coloring of graphs

This page was built for publication: On indicated coloring of graphs