Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
type: Item
instance of: scholarly article
title: Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
zbMATH Open document ID: 1257.05038
published in: Science China. Mathematics
publication date: 2013-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6131923
zbMATH Keywords: total coloring
zbMATH Keywords: total chromatic number
zbMATH Keywords: planar graph
zbMATH Keywords: chordal 4-cycles
zbMATH Keywords: triangles
author: Jiansheng Cai
author: Guanghui Wang
author: Guiying Yan
MaRDI profile type: Publication
full work available at URL: s11425-012-4531-7
OpenAlex ID: W2253575531
cites work: On the total coloring of planar graphs.
cites work: Total colorings of planar graphs with large maximum degree
cites work: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
cites work: Total coloring of planar graphs without 6-cycles
cites work: Total coloring of embedded graphs of maximum degree at least ten
cites work: Total colorings of planar graphs without small cycles
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: Total colorings and list total colorings of planar graphs without intersecting 4-cycles
cites work: Planar graphs without 5-cycles or without 6-cycles
cites work: On total 9-coloring planar graphs of maximum degree seven
cites work: Total colorings of planar graphs with maximum degree at least 8
cites work: Q5564127
DOI: 10.1007/S11425-012-4531-7
description: scientific article; zbMATH DE number 6131923