| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427511 | Information Processing Letters | 2010 | 5 Pages |
Abstract
By a short cycle we mean a cycle of length at most 4. In this paper, we prove that every plane graph with maximum degree Δ at least 6 and without adjacent short cycles is (Δ+1)-totally-colorable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
