On the difference between chromatic number and dynamic chromatic number of graphs
From MaRDI portal
Publication:442373
DOI10.1016/J.DISC.2011.09.006zbMATH Open1246.05050OpenAlexW2038606831MaRDI QIDQ442373FDOQ442373
Authors: S. Akbari, M. Ghanbari, A. Ahadi, A. 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Complexity of conditional colorability of graphs
- Conditional colorings of graphs
- Title not available (Why is that?)
- Dynamic list coloring of bipartite graphs
- Title not available (Why is that?)
- Approximating theDomatic Number
- Title not available (Why is that?)
- The 2nd-order conditional 3-coloring of claw-free graphs
- List coloring of graphs having cycles of length divisible by a given number
- Every 8-uniform 8-regular hypergraph is 2-colorable
- Title not available (Why is that?)
- On the dynamic coloring of Cartesian product graphs
- Title not available (Why is that?)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Cited In (25)
- \(r\)-Dynamic chromatic number of some line graphs
- \(r\)-dynamic chromatic number of subdivision-edge neighborhood corona of certain graph families
- The $r$-dynamic edge coloring of a closed helm graph
- Element deletion changes in dynamic coloring of graphs
- Title not available (Why is that?)
- Dynamic chromatic number of regular graphs
- On \(r\)-dynamic chromatic number of graphs
- On \(r\)-hued colorings of graphs without short induced paths
- On \(r\)-dynamic coloring of double star graph families
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- Optimal secret share distribution in degree splitting communication networks
- Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
- On r− dynamic coloring of the gear graph families
- The chromatic discrepancy of graphs
- On \(r\)-dynamic coloring of grids
- On r- dynamic coloring of the family of bistar graphs
- Graph \(r\)-hued colorings -- a survey
- Title not available (Why is that?)
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- On dynamic coloring of certain cycle-related graphs
- Dynamic list coloring of 1-planar graphs
- \(\delta\)-dynamic chromatic number of helm graph families
- On \(r\)-dynamic coloring of the total graphs of gear graphs
- \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs
- On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph
This page was built for publication: On the difference between chromatic number and dynamic chromatic number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442373)
