Hits :

First Author : Min Chen

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.27

Issue : No.3

Page Number : 440-450

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Planar;subcubic;graph;List;star;coloring;In-coloring;Orientation

Abstract : A proper coloring of the vertices of a graph G is called a star-coloring if the union of every two color classes induces a star forest. The graph G is L-star-colorable if for a given list assignment L there is a star-coloring π such that π(v)∈L(v). If G i