Hits :

First Author : Kan WANG

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : 数学研究及应用

Issue : No.6

Page Number : 647-653

Translation or Not : no

Key Words : planar;graph;linear;coloring;maximum;degree

Abstract : A linear coloring of a graph G is a proper vertex coloring such that 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 color