Indicated coloring of the Mycielskian of some families of graphs

DOI10.1142/s1793830922500690zbMath1516.05065OpenAlexW4220759386MaRDI QIDQ6174150

No author found.

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500690

zbMATH Keywords

game chromatic numberindicated chromatic numberMycielskian of graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of the generalised Mycielskian of digraphs
• Indicated coloring of matroids
• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
• On indicated coloring of graphs
• Paw-free graphs
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Indicated coloring of graphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• On indicated chromatic number of graphs
• Connectivity of the Mycielskian of a graph
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Several parameters of generalized Mycielskians
• Circular chromatic number and Mycielski construction
• Sur le coloriage des graphs
• On indicated coloring of some classes of graphs