| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427953 | Information Processing Letters | 2010 | 5 Pages |
Abstract
In the current paper, we prove the 11-total choosability of planar graphs with maximum degree Δ⩽8, the (Δ+1)-total choosability of 5-cycle-free planar graphs with maximum degree Δ⩾8, the 5-total choosability of graphs with maximum degree Δ=4 and maximum average degree mad<3, and the 4-total choosability of subcubic graphs with maximum average degree .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
