| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436919 | Theoretical Computer Science | 2013 | 8 Pages |
Abstract
Planar graphs with maximum degree Δ≥8 and without 5-cycles with two chords are proved to be totally (Δ+1)-colorable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
