Journal
SIAM JOURNAL ON DISCRETE MATHEMATICS
Volume 22, Issue 4, Pages 1462-1479Publisher
SIAM PUBLICATIONS
DOI: 10.1137/070688389
Keywords
total-coloring; planar graph; discharging method
Categories
Funding
- European project IST FET AEOLUS
Ask authors/readers for more resources
The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree. admits a (Delta + 2)-total-coloring. Similar to edge-colorings-with Vizing's edge-coloring conjecture-this bound can be decreased by 1 for plane graphs of higher maximum degree. More precisely, it is known that if Delta >= 10, then every plane graph of maximum degree Delta is (Delta + 1)-totally-colorable. On the other hand, such a statement does not hold if Delta <= 3. We prove that every plane graph of maximum degree 9 can be 10-totally-colored.
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