On r- dynamic coloring of the family of bistar graphs

DOI10.31801/cfsuasmas.489727zbMath1490.05081OpenAlexW2902715463MaRDI QIDQ5865868

G. Nandini, M. Venkatachalam, Unnamed Author

Publication date: 10 June 2022

Published in: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.31801/cfsuasmas.489727

zbMATH Keywords

line graphtotal graphmiddle graphcentral graph\(r\)-dynamic coloringbistar graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (max. 100)

The $r$-dynamic edge coloring of a closed helm graph ⋮ On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph

Cites Work

• On the difference between chromatic number and dynamic chromatic number of graphs
• 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
• The 2nd-order conditional 3-coloring of claw-free graphs
• On the list dynamic coloring of graphs
• Complexity of conditional colorability of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On r- dynamic coloring of the family of bistar graphs