Weak Dynamic Coloring of Planar Graphs
Publication Date
4-1-2024
Document Type
Article
Publication Title
Graphs and Combinatorics
Volume
40
Issue
2
DOI
10.1007/s00373-023-02748-3
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.
Funding Number
CMMI-1727743
Funding Sponsor
National Science Foundation
Keywords
05C10, 05C15, 05C35, Coloring of graphs, Extremal problems, Planar graphs
Department
Mathematics and Statistics
Recommended Citation
Caroline Accurso, Vitaliy Chernyshov, Leaha Hand, Sogol Jahanbekam, and Paul Wenger. "Weak Dynamic Coloring of Planar Graphs" Graphs and Combinatorics (2024). https://doi.org/10.1007/s00373-023-02748-3
COinS
