Skip to main content
Unpublished Paper
Weak Dynamic Coloring of Planar Graphs
(2018)
  • Caroline Accurso, DeSales University
  • Vitaliy Chernyshov, Rochester Institute of Technology
  • Leaha Hand, Boise State University
  • Sogol Jahanbekam, Rochester Institute of Technology
  • Paul Wenger, Rochester Institute of Technology
Abstract
The k-weak-dynamic number of a graph G is the smallest number of colors we need to color the vertices of G in such a way that each vertex v of degree d(v) sees at least min{k, d(v)} colors on its neighborhood. We use reducible configurations and list coloring of graphs to prove that all planar graphs have 3-weak-dynamic number at most 6.
Keywords
  • coloring of graphs and hypergraphs,
  • planar graphs
Publication Date
February 16, 2018
Comments
This work can also be found on arxiv.org at this link.
Citation Information
Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam, et al.. "Weak Dynamic Coloring of Planar Graphs" (2018)
Available at: http://works.bepress.com/sogol-jahanbekam/44/