Total coloring of planar graphs with maximum degree 7

Authors:
Bing Wang;Jian-Liang Wu
Affiliations:
School of Mathematics, Shandong University, Jinan, 250100, PR China and Department of Mathematics, Zaozhuang University, Shandong, 277160, China;School of Mathematics, Shandong University, Jinan, 250100, PR China
Venue:
Information Processing Letters
Year:
2011

Citing 8
Cited 1

The total chromatic number of any multigraph with maximum degree five is at most seven

Discrete Mathematics
Total colorings of planar graphs with large maximum degree

Journal of Graph Theory
List edge and list total colourings of multigraphs

Journal of Combinatorial Theory Series B
Graph Theory With Applications

Graph Theory With Applications
On total 9-coloring planar graphs of maximum degree seven

Journal of Graph Theory
Total-Coloring of Plane Graphs with Maximum Degree Nine

SIAM Journal on Discrete Mathematics
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable

Discrete Applied Mathematics
Total coloring of planar graphs of maximum degree eight

Information Processing Letters

Total colorings of planar graphs without intersecting 5-cycles

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

In the paper, it is proved that a planar graph of maximum degree @D=7 is (@D+1)-totally-colorable if no 3-cycle has a common vertex with a 4-cycle or no 3-cycle is adjacent to a cycle of length less than 6.