Sciweavers

DM
2010
78views more  DM 2010»
13 years 11 months ago
Injective colorings of sparse graphs
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) + 1; sim...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 11 months ago
Injective colorings of graphs with low average degree
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 4 and mad(G) < 14 5 , then i(G...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu