Title of article
2-distance -coloring of planar graphs with girth six and
Author/Authors
Borodin، نويسنده , , O.V. and Ivanova، نويسنده , , A.O.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
6496
To page
6502
Abstract
It was proved in [Z. Dvořàk, D. Kràl, P. Nejedlỳ, R. Škrekovski, Coloring squares of planar graphs with girth six, European J. Combin. 29 (4) (2008) 838–849] that every planar graph with girth g ≥ 6 and maximum degree Δ ≥ 8821 is 2-distance ( Δ + 2 ) -colorable. We prove that every planar graph with g ≥ 6 and Δ ≥ 18 is 2-distance ( Δ + 2 ) -colorable.
Keywords
graph , 2 distance coloring , Coloring , girth
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598241
Link To Document