| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872666 | Discrete Applied Mathematics | 2012 | 9 Pages |
Abstract
⺠We study linear coloring of graphs. ⺠Cranston and Yu conjecture that graphs with maximum average degree less than 3 are linearly âÎ2â+2 colorable. ⺠We prove this conjecture for graphs with maximum average degree less than 2.8.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yingqian Wang, Qian Wu,