On the difference between chromatic number and dynamic chromatic number of graphs
From MaRDI portal
Publication:442373
DOI10.1016/j.disc.2011.09.006zbMath1246.05050OpenAlexW2038606831MaRDI QIDQ442373
Saieed Akbari, Maryam Ghanbari, Arash Ahadi, Ali Dehghan
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.006
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Bounds on the dynamic chromatic number of a graph in terms of its chromatic number ⋮ Dynamic list coloring of 1-planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Unnamed Item ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ The $r$-dynamic edge coloring of a closed helm graph ⋮ Optimal secret share distribution in degree splitting communication networks ⋮ On \(r\)-dynamic chromatic number of graphs ⋮ Unnamed Item ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ Dynamic chromatic number of regular graphs ⋮ Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number ⋮ δ-Dynamic chromatic number of Helm graph families ⋮ On dynamic coloring of certain cycle-related graphs ⋮ Unnamed Item ⋮ \(r\)-Dynamic chromatic number of some line graphs ⋮ \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs ⋮ On \(r\)-dynamic coloring of grids ⋮ On r- dynamic coloring of the family of bistar 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 the gear graph families
Cites Work
- Dynamic list coloring of bipartite graphs
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- The 2nd-order conditional 3-coloring of claw-free graphs
- Complexity of conditional colorability of graphs
- List coloring of graphs having cycles of length divisible by a given number
- Every 8-uniform 8-regular hypergraph is 2-colorable
- Conditional colorings of graphs
- Approximating theDomatic Number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the difference between chromatic number and dynamic chromatic number of graphs
