Hits :

First Author : Chao Li

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

Date of Publication : 2011-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.311

Issue : No.4

Page Number : 232-238

ISSN : 0012-365X

Translation or Not : no

Key Words : Linear;coloring;Planar;graph;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 a 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. Let G