Total coloring of planar graphs with maximum degree \(7\)
type: Item
instance of: scholarly article
title: Total coloring of planar graphs with maximum degree \(7\)
zbMATH Open document ID: 1260.05064
author: Bing Wang
author: Jian-Liang Wu
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6150482
zbMATH Keywords: combinatorial problems
zbMATH Keywords: total coloring
zbMATH Keywords: planar graph
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.07.012
OpenAlex ID: W2097053745
cites work: On the total coloring of planar graphs.
cites work: List edge and list total colourings of multigraphs
cites work: Total colorings of planar graphs with large maximum degree
cites work: Q5422499
cites work: Total colorings of planar graphs with maximum degree at least 8
cites work: Total coloring of planar graphs of maximum degree eight
cites work: The total chromatic number of any multigraph with maximum degree five is at most seven
cites work: Total-Coloring of Plane Graphs with Maximum Degree Nine
cites work: On total 9-coloring planar graphs of maximum degree seven
cites work: Q5564127
cites work: A note on total colorings of planar graphs without 4-cycles
DOI: 10.1016/J.IPL.2011.07.012
description: scientific article; zbMATH DE number 6150482