Hits :

First Author : WeiFan Wang

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Science in China, Series A: Mathematics, Physics, Astronomy

Volume: Vol.52

Issue : No.5

Page Number : 991-1003

ISSN : 1001-6511

Translation or Not : no

Key Words : linear;coloring;graph;of;nonnegative;characteristic;girth;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 the graph G is the smallest number of colors in a linear coloring of