A Sufficient Condition for Planar Graphs with Maximum Degree 8 to Be 9-totally Colorable
A Sufficient Condition for Planar Graphs with Maximum Degree 8 to Be 9-totally Colorable
About this item
Full title
Author / Creator
Publisher
Heidelberg: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Journal title
Language
English
Formats
Publication information
Publisher
Heidelberg: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Subjects
More information
Scope and Contents
Contents
A total k-coloring of a graph G is a coloring of V（G） ∪ E（G） using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ＇＇（G） is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree △≥ 9, then ）χ″（G） =△＋ 1. In this paper, we prove th...
Alternative Titles
Full title
A Sufficient Condition for Planar Graphs with Maximum Degree 8 to Be 9-totally Colorable
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1541436065
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1541436065
Other Identifiers
ISSN
1439-8516
E-ISSN
1439-7617
DOI
10.1007/s10114-014-3170-z
