| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 6872468 | Discrete Applied Mathematics | 2014 | 10 Pages | 
Abstract
												We determine the list chromatic number of the square of a graph Ïâ(G2) in terms of its maximum degree Î when its maximum average degree, denoted mad(G), is sufficiently small. For Îâ¥6, if mad(G)<2+4Îâ85Î+2, then Ïâ(G2)=Î+1. In particular, if G is planar with girth gâ¥7+12Îâ2, then Ïâ(G2)=Î+1. Under the same conditions, Ïâi(G)=Î, where Ïâi is the list injective chromatic number.
											Related Topics
												
													Physical Sciences and Engineering
													Computer Science
													Computational Theory and Mathematics
												
											Authors
												Daniel W. Cranston, Riste Å krekovski, 
											