1 research outputs found
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is -forested if the graph
induced by the vertices of any two color classes is a forest with maximum
degree less than . A graph is -forested -choosable if for a given list
of colors associated with each vertex , there exists a -forested
coloring of such that each vertex receives a color from its own list. In
this paper, we prove that the -forested choosability of a graph with maximum
degree is at most ,
or if its
maximum average degree is less than 12/5, $8/3 or 3, respectively.Comment: Please cite this paper in press as X. Zhang, G. Liu, J.-L. Wu,
k-forested choosability of graphs with bounded maximum average degree,
Bulletin of the Iranian Mathematical Society, to appea