Title of article
Injective coloring of planar graphs with girth 6
Author/Authors
Dong، نويسنده , , Wei and Lin، نويسنده , , Wensong، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
10
From page
1302
To page
1311
Abstract
An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. Let χ i ( G ) be the injective chromatic number of a graph G . In this paper, we investigate the injective coloring of planar graphs with girth 6. We improve some results of Borodin and Ivanova (2011) [1], Doyon et al. (2010) [4] and Li and Xu (2012) [6] by showing that if G is a planar graph with girth at least 6, then (1) χ i ( G ) ≤ Δ + 3 ; (2) χ i ( G ) ≤ Δ + 2 if Δ ≥ 9 ; (3) χ i ( G ) ≤ Δ + 1 if Δ ≥ 17 .
Keywords
girth , Injective coloring , cycle , Planar graph
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600334
Link To Document