On r-dynamic coloring of the total graphs of gear graphs
From MaRDI portal
Recommendations
Cites work
- -dynamic chromatic number of helm graph families
- Complexity of conditional colorability of graphs
- Dynamic chromatic number of regular graphs
- Graph theory
- Harmonious colouring of cycles, regular graphs, star n-leaf, festoon trees and bigraphs
- scientific article; zbMATH DE number 5901911 (Why is no real title available?)
- scientific article; zbMATH DE number 3845603 (Why is no real title available?)
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- scientific article; zbMATH DE number 3422404 (Why is no real title available?)
- On \(r\)-dynamic chromatic number of graphs
- On the difference between chromatic number and dynamic chromatic number of graphs
- On the list dynamic coloring of graphs
- The 2nd-order conditional 3-coloring of claw-free graphs
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Cited in
(6)- On r-dynamic coloring of the family of tadpole graphs.
- -dynamic chromatic number of helm graph families
- On r− dynamic coloring of the gear graph families
- On the \(r\)-dynamic coloring of the direct product of a path and a \(k\)-subdivision of a star graph
- The $r$-dynamic edge coloring of a closed helm graph
- Solving the dynamic coloring problem for direct products of paths with fan graphs
This page was built for publication: On \(r\)-dynamic coloring of the total graphs of gear graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376964)