Title of article :
Injective colorings of sparse graphs
Author/Authors :
Cranston، نويسنده , , Daniel W. and Kim، نويسنده , , Seog-Jin and Yu، نويسنده , , Gexin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
Let mad ( G ) denote the maximum average degree (over all subgraphs) of G and let χ i ( G ) denote the injective chromatic number of G . We prove that if mad ( G ) ≤ 5 2 , then χ i ( G ) ≤ Δ ( G ) + 1 ; and if mad ( G ) < 42 19 , then χ i ( G ) = Δ ( G ) . Suppose that G is a planar graph with girth g ( G ) and Δ ( G ) ≥ 4 . We prove that if g ( G ) ≥ 9 , then χ i ( G ) ≤ Δ ( G ) + 1 ; similarly, if g ( G ) ≥ 13 , then χ i ( G ) = Δ ( G ) .
Keywords :
Injective coloring , maximum average degree , Planar graph
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics