Journal
INFORMATION PROCESSING LETTERS
Volume 111, Issue 15, Pages 767-772Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2011.05.006
Keywords
Combinatorial problems; Plane graph; Total coloring; Maximum degree; Chordal cycle
Categories
Funding
- Natural Science Foundation of Zhejiang Province, China [Y6090699]
- Natural Science Foundation of China [10971198]
- Zhejiang Innovation Project [T200905]
Ask authors/readers for more resources
In this paper, we prove that a plane graph of maximum degree Delta >= 6 is (Delta + 1)-totally-colorable if it contains neither chordal 5-cycle nor chordal 6-cycle. This further extends the known class of plane graphs of maximum degree Delta in which every graph is (Delta + 1)-totally-colorable. (C) 2011 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
