Hits :

First Author : Wang, Weifan

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : UTILITAS MATHEMATICA

Volume: Vol.95

Page Number : 199-213

ISSN : 0315-3681

Translation or Not : no

Key Words : Linear coloring;graph;Euler characteristic

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. In this p