Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
type: Item
instance of: scholarly article
title: Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
zbMATH Open document ID: 1223.05037
author: Gerard Jennhwa Chang
author: Nicolas Roussel
author: Jianfeng Hou
published in: Discrete Applied Mathematics
publication date: 2011-05-17T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 5895536
zbMATH Keywords: total coloring
zbMATH Keywords: total chromatic number
zbMATH Keywords: planar graphs
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.dam.2011.01.001
OpenAlex ID: W2001158340
cites work: Total colorings of planar graphs with large maximum degree
cites work: Total colorings of planar graphs without small cycles
cites work: The total coloring of a multigraph with maximal degree 4
cites work: The total chromatic number of any multigraph with maximum degree five is at most seven
cites work: On the total coloring of certain graphs
cites work: Total coloring of planar graphs of maximum degree eight
cites work: Local condition for planar graphs of maximum degree 6 to be total 8-colorable
cites work: Total-Coloring of Plane Graphs with Maximum Degree Nine
cites work: Total colorings of planar graphs with maximum degree at least 8
cites work: Total colorings of planar graphs without adjacent triangles
cites work: On Total Chromatic Number of a Graph
cites work: Q5564127
cites work: Total chromatic number of planar graphs with maximum degree ten
DOI: 10.1016/J.DAM.2011.01.001
Recommended article: Local condition for planar graphs of maximum degree 6 to be total 8-colorable
Recommended article: A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
Recommended article: Total coloring of planar graphs with maximum degree \(7\)
Recommended article: A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
Recommended article: Q4640889
Recommended article: A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Recommended article: Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
Recommended article: Total coloring of planar graphs with maximum degree 8
Recommended article: Total coloring of planar graphs of maximum degree eight
Recommended article: Total colorings of planar graphs with maximum degree at least 8
description: scientific article; zbMATH DE number 5895536