Article ID Journal Published Year Pages File Type
8903022 Discrete Mathematics 2018 13 Pages PDF
Abstract
In this paper, we study list 3-dynamic coloring in terms of maximum average degree. We show that ch3d(G)≤6 if mad(G)<187, ch3d(G)≤7 if mad(G)<145, and ch3d(G)≤8 if mad(G)<3. All of the bounds are tight.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
List 3-dynamic coloring of graphs with small maximum average degree
Authors
, ,