1 |
Y. Bu, D. Chen, A. Raspaud, and W. Wang, Injective coloring of planar graphs, Discrete Appl. Math. 157 (2009), no. 4, 663-672.
DOI
ScienceOn
|
2 |
D. W. Cranston, S.-J. Kim, and G. Yu, Injective colorings of sparse graphs, Discrete Math. 310 (2010), no. 21, 2965-2973.
DOI
ScienceOn
|
3 |
A. Doyon, G. Hahn, and A. Raspaud, Some bounds on the injective chromatic number of graphs, Discrete Math. 310 (2010), 585-590.
DOI
ScienceOn
|
4 |
R. Li and B. Xu, Injective choosability of planar graphs of girth five and six, Discrete Math. 312 (2012), no. 6, 1260-1265.
DOI
ScienceOn
|
5 |
D. B. West, Introduction to Graph Theory, Prentice Hall Inc., Upper Saddle Rive, NJ, 2001.
|
6 |
G. Wenger, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, 1977.
|
7 |
O. V. Borodin and A. O. Ivanova, List injective colorings of planar graphs, Discrete Math. 311 (2011), no. 2-3, 154-165.
DOI
ScienceOn
|
8 |
O. V. Borodin and A. O. Ivanova, 2-distance ()-coloring of planar graphs with girth six and , Discrete Math. 309 (2009), no. 23-24, 6496-6502.
DOI
ScienceOn
|