On r-dynamic vertex coloring of some flower graph families

DOI10.1142/S179383092150097XzbMath1482.05106OpenAlexW3124680530MaRDI QIDQ5063273

Arika Indah Kristina, C. S. Gomathi, N. Mohanapriya, D. Dafik

Publication date: 17 March 2022

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

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

zbMATH Keywords

line graphMycielski graphsubdivision graphsplitting graphcentral graph\(r\)-dynamic coloringline of subdivision graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic chromatic number of regular graphs
• Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
• On \(r\)-dynamic chromatic number of graphs
• \(r\)-Dynamic chromatic number of some line graphs
• On certain coloring parameters of Mycielski graphs of some graphs

This page was built for publication: On r-dynamic vertex coloring of some flower graph families