Hits :

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

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.341

Issue : No.12

Page Number : 3344-3347

ISSN : 0012-365X

Translation or Not : no

Key Words : Toroidal;graph;Complete;graph;K;7;List;vertex;arboricity

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. In this note, we prove t