| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436949 | Theoretical Computer Science | 2006 | 6 Pages |
Abstract
Let G be a planar graph with maximum degree Δ such that G has no cycle of length from 4 to k, where k⩾4. Then the list chromatic index and the list total chromatic number if (Δ,k)∈{(7,4),(6,5),(5,8)}. Furthermore, if (Δ,k)∈{(4,14)}.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
