r-Dynamic chromatic number of some line graphs
From MaRDI portal
Publication:2322985
Recommendations
Cites work
- scientific article; zbMATH DE number 5901911 (Why is no real title available?)
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Complexity of conditional colorability of graphs
- Dynamic chromatic number of regular graphs
- On \(r\)-dynamic chromatic number of graphs
- On \(r\)-dynamic coloring 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
(11)- \(r\)-dynamic chromatic number of subdivision-edge neighborhood corona of certain graph families
- The $r$-dynamic edge coloring of a closed helm graph
- On \(r\)-dynamic vertex coloring of some flower graph families
- On \(r\)-hued coloring of corona product of some graphs
- On \(r\)-dynamic coloring of \(R\)-vertex corona of graphs
- On the \(r\)-dynamic coloring of the direct product of a path and a \(k\)-subdivision of a star graph
- On \(r\)-dynamic coloring of para-line graph of some standard graphs
- Channel assignment with \(r\)-dynamic coloring
- On \(r\)-dynamic coloring of grids
- \(\delta\)-dynamic chromatic number of helm graph families
- On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
This page was built for publication: \(r\)-Dynamic chromatic number of some line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322985)