On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)

DOI10.1142/S1793557122501029zbMath1489.05053OpenAlexW3191897968MaRDI QIDQ5083048

No author found.

Publication date: 21 June 2022

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

brick product graph\(r\)-dynamic coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(r\)-dynamic coloring of graphs
• On \(r\)-dynamic chromatic number of graphs
• On a class of Hamiltonian laceable 3-regular graphs
• On the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph
• On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle
• On dynamic coloring of certain cycle-related graphs
• \(r\)-Dynamic chromatic number of some line graphs
• δ-Dynamic chromatic number of Helm graph families
• RAINBOW CONNECTION IN MODIFIED BRICK PRODUCT GRAPHS

This page was built for publication: On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)