Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Total Coloring of Planar Graphs with Maximum Degree Six
verfasst von : Xiaodong Li
Erschienen in: Recent Advances in Computer Science and Information Engineering
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The minimum number of colors needed to properly color the vertices and edges of a graph
G
is called the total chromatic number of
G
and denoted by
χ
”(G). In this paper, the some known results are strengthen and prove that if
G
is a planar graph with maximum degree six, and for each vertex
v
, there is an integer
k
v
∈ {3,4,5,6} such that
G
has no
k
v
-cycle which contains v, then
χ
”(
G
) ≤ 8.