Title of article
2-distance coloring of sparse graphs
Author/Authors
Bonamy، نويسنده , , Marthe and Lévêque، نويسنده , , Benjamin and Pinlou، نويسنده , , Alexandre، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
155
To page
160
Abstract
A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most 2 receive distinct colors. We prove that every graph with maximum degree Δ at least 4 and maximum average degree less that 7 3 admits a 2-distance ( Δ + 1 ) -coloring. This result is tight. This improves previous known results of Dolama and Sopena.
Keywords
maximum average degree , square coloring , 2-distance coloring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455790
Link To Document