王维凡
professor
Gender : Male
Alma Mater : 南京大学
Education Level : Graduate student graduate
Degree : Doctorate
Status : 退休
School/Department : 数学科学学院
Date of Employment : 2002-05-01
Hits :
First Author : Chen, Min
Affiliation of Author(s): 数理与信息工程学院
Date of Publication : 2016-01-01
Document Type : 期刊
Journal : Discrete Mathematics
Volume: Vol.339
Issue : No.10
Page Number : 2526-2535
ISSN : 0012-365X
Translation or Not : no
Key Words : Adjacent;cycles;List;vertex-arboricity;Monochromatic;cycle;Toroidal;graphs
Abstract : The vertex-arboricity a ( G ) of a graph G is the minimum number of colors required to color the vertices of G such that no cycle is monochromatic. The list vertex-arboricity a l ( G ) is the list-coloring version of this concept. Kronk and Mitchem (1975)