Total coloring of embedded graphs of maximum degree at least ten
type: Item
instance of: scholarly article
title: Total coloring of embedded graphs of maximum degree at least ten
zbMATH Open document ID: 1210.05040
author: Bin Liu
author: Jianfeng Hou
author: Jian-Liang Wu
author: Guizhen Liu
published in: Science China. Mathematics
publication date: 2011-02-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5857650
zbMATH Keywords: surface
zbMATH Keywords: Euler characteristic
zbMATH Keywords: total coloring
zbMATH Keywords: total chromatic number
MaRDI profile type: Publication
full work available at URL: s11425-010-3089-5
OpenAlex ID: W2170724959
cites work: On the total coloring of planar graphs.
cites work: Total colorings of planar graphs with large maximum degree
cites work: Total colourings of planar graphs with large girth
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: On the total coloring of certain graphs
cites work: Determining the total colouring number is NP-hard
cites work: On total 9-coloring planar graphs of maximum degree seven
cites work: On Total Chromatic Number of a Graph
cites work: Q5564127
cites work: A note on total colorings of planar graphs without 4-cycles
cites work: Total chromatic number of planar graphs with maximum degree ten
cites work: List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
cites work: Total colourings of graphs
cites work: On the Total Coloring of Graphs Embeddable in Surfaces
DOI: 10.1007/S11425-010-3089-5
description: scientific article; zbMATH DE number 5857650