Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
type: Item
instance of: scholarly article
title: Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
zbMATH Open document ID: 1220.05028
author: Lan Shen
author: Yingqian Wang
published in: Discrete Mathematics
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5798532
zbMATH Keywords: planar graph
zbMATH Keywords: total coloring
zbMATH Keywords: maximum degree
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.disc.2010.05.008
OpenAlex ID: W2079830104
cites work: Q5422499
cites work: On the total coloring of planar graphs.
cites work: Q3784093
cites work: List edge and list total colourings of multigraphs
cites work: Total colorings of planar graphs with large maximum degree
cites work: Total colourings of planar graphs with large girth
cites work: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
cites work: List edge and list total colorings of planar graphs without 4-cycles
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: Total-Coloring of Plane Graphs with Maximum Degree Nine
cites work: List edge and list total colorings of planar graphs without short cycles
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 the total coloring of certain graphs
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: On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
cites work: On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting 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
cites work: On total chromatic number of planar graphs without 4-cycles
cites work: A note on total colorings of planar graphs without 4-cycles
cites work: Total colourings of graphs
DOI: 10.1016/J.DISC.2010.05.008
Recommended article: Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
Recommended article: Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
Recommended article: Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
Recommended article: On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Recommended article: Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
Recommended article: Total coloring of planar graphs with maximum degree 8
Recommended article: Planar graphs without 4-, 5- and 8-cycles are 3-colorable
Recommended article: Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
Recommended article: Total coloring of planar graphs with maximum degree \(7\)
Recommended article: Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
description: scientific article; zbMATH DE number 5798532