On the difference between chromatic number and dynamic chromatic number of graphs

DOI10.1016/J.DISC.2011.09.006MaRDI QIDQ442373zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic coloringindependent numbervertex coloring

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
• scientific article; zbMATH DE number 2197944
• On the dynamic coloring of graphs
• scientific article; zbMATH DE number 5901911
• Element deletion changes in dynamic coloring of graphs

Cites work

• scientific article; zbMATH DE number 6383853 (Why is no real title available?)
• scientific article; zbMATH DE number 5901911 (Why is no real title available?)
• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• scientific article; zbMATH DE number 2192159 (Why is no real title available?)
• scientific article; zbMATH DE number 2197944 (Why is no real title available?)
• Approximating theDomatic Number
• Complexity of conditional colorability of graphs
• Conditional colorings of graphs
• Dynamic list coloring of bipartite graphs
• Every 8-uniform 8-regular hypergraph is 2-colorable
• List coloring of graphs having cycles of length divisible by a given number
• On the dynamic coloring of Cartesian product 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

(25)

• \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs
• Dynamic list coloring of 1-planar graphs
• Element deletion changes in dynamic coloring of graphs
• Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
• Optimal secret share distribution in degree splitting communication networks
• On \(r\)-dynamic coloring of double star graph families
• On \(r\)-dynamic coloring of the total graphs of gear graphs
• On dynamic coloring of certain cycle-related graphs
• On \(r\)-hued colorings of graphs without short induced paths
• On \(r\)-dynamic coloring of subdivision-vertex join of two graphs
• Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
• On the \(r\)-dynamic coloring of the direct product of a path and a \(k\)-subdivision of a star graph
• \(r\)-Dynamic chromatic number of some line graphs
• On r- dynamic coloring of the family of bistar graphs
• The $r$-dynamic edge coloring of a closed helm graph
• Dynamic chromatic number of regular graphs
• \(\delta\)-dynamic chromatic number of helm graph families
• A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
• scientific article; zbMATH DE number 5901911 (Why is no real title available?)
• Graph \(r\)-hued colorings -- a survey
• On \(r\)-dynamic coloring of grids
• On r− dynamic coloring of the gear graph families
• On \(r\)-dynamic chromatic number of graphs
• The chromatic discrepancy of graphs
• \(r\)-dynamic chromatic number of subdivision-edge neighborhood corona of certain graph families

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)