image-coloring of sparse graphs Original Research Article

A graph image is called image-colorable, if the vertex set of image can be partitioned into subsets image and image such that the graph image induced by the vertices of image has maximum degree at most image and the graph image induced by the vertices of image has maximum degree at most image. In this paper, we give a sufficient condition of image-colorability for graphs with bounded maximum average degree.