Total coloring of planar graphs with maximum degree 8

Authors:
Huijuan Wang;Lidong Wu;Jianliang Wu
Affiliations:
School of Mathematics, Shandong University, Jinan, 250100, China;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;School of Mathematics, Shandong University, Jinan, 250100, China
Venue:
Theoretical Computer Science
Year:
2014

Citing 13
Cited 0

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

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications
List edge and list total colorings of planar graphs without 4-cycles

Theoretical Computer Science
On total 9-coloring planar graphs of maximum degree seven

Journal of Graph Theory
Total Colorings of Planar Graphs without Small Cycles

Graphs and Combinatorics
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
Note: Total coloring of planar graphs without 6-cycles

Discrete Applied Mathematics
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable

Discrete Applied Mathematics
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords

Theoretical Computer Science
Total coloring of embedded graphs with maximum degree at least seven

Theoretical Computer Science
Note: Total coloring of planar graphs with 7-cycles containing at most two chords

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Let G be a planar graph with @D=8 and without adjacent cycles of size i and j, for some 3=