| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949655 | Discrete Applied Mathematics | 2017 | 6 Pages |
Abstract
In this paper, the behavior and bounds of 3-dynamic coloring and list 3-dynamic coloring of K1,3-free graphs are investigated. We show that if G is K1,3-free, then ÏL,3(G)â¤max{ÏL(G)+3,7} and Ï3(G)â¤max{Ï(G)+3,7}. The results are best possible as 7 cannot be reduced.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hao Li, Hong-Jian Lai,