Hits :

First Author : Weifan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2013-01-01

Document Type : 期刊

Journal : Graphs and Combinatorics

Volume: Vol.29

Issue : No.4

Page Number : 1113-1124

ISSN : 0911-0119

Translation or Not : no

Key Words : Linear;coloring;Planar;graph;Cycle;Maximum;degree

Abstract : A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc(G) of G is the smallest number of colors in a linear coloring of G. In this