DocumentCode
3104325
Title
Total Colorings of Planar Graphs with Maximum Degree Seven and without 3-Cycles Adjacent to 4-Cycles
Author
Wang, Bing ; Wu, MJian-Liang
Author_Institution
Dept. of Math., Zaozhuang Univ., Zaozhuang, China
fYear
2011
fDate
16-18 Aug. 2011
Firstpage
1
Lastpage
4
Abstract
Let G be a planar graph with maximum degree Δ≥7 and without 3-cycles adjacent to 4-cycles, that is, any 3-cycle has not a common edge with a 4-cycle. Then the total chromatic number of G is (Δ+1).
Keywords
graph colouring; chromatic number; planar graph coloring; Color; Educational institutions; Face; Finite element methods; Graph theory; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Internet Technology and Applications (iTAP), 2011 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-7253-6
Type
conf
DOI
10.1109/ITAP.2011.6006204
Filename
6006204
Link To Document