Title of article
image-coloring of sparse graphs Original Research Article
Author/Authors
O.V. Borodin، نويسنده , , A.O. Ivanova، نويسنده , , M. Montassier، نويسنده , , A. Raspaud، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
1947
To page
1953
Abstract
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.
Keywords
Subgraphs with bounded maximum degree , Maximum average degree , Linear programming , Discharging procedure , Vertex partition
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887739
Link To Document