A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
type: Item
instance of: scholarly article
title: A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
zbMATH Open document ID: 1359.05047
author: Lin Sun
author: Hua Cai
author: Jian-Liang Wu
publication date: 2017-04-03T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6699853
zbMATH Keywords: 1-planar graph
zbMATH Keywords: total coloring
zbMATH Keywords: discharging method
zbMATH Keywords: girth
MaRDI profile type: Publication
full work available at URL: s10114-016-5480-9
OpenAlex ID: W2531438039
cites work: Q3097395
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: A note on total colorings of 1-planar graphs
cites work: Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
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: Ein Sechsfarbenproblem auf der Kugel
cites work: On the total coloring of certain graphs
cites work: Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
cites work: Determining the total colouring number is NP-hard
cites work: On Total Chromatic Number of a Graph
cites work: Q5564127
cites work: Total colorings of planar graphs without chordal 6-cycles
cites work: Total chromatic number of planar graphs with maximum degree ten
cites work: On total colorings of 1-planar graphs
cites work: On edge colorings of \(1\)-planar graphs
cites work: List edge and list total coloring of 1-planar graphs
DOI: 10.1007/S10114-016-5480-9
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 6699853