Skip to main content
Weak Dynamic Coloring of Planar Graphs
AMS Spring Eastern Sectional Meeting (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
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. 
Publication Date
April 22, 2018
Boston, MA
Citation Information
Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam, et al.. "Weak Dynamic Coloring of Planar Graphs" AMS Spring Eastern Sectional Meeting (2018)
Available at: