Acknowledgement
The author thanks the anonymous reviewers for their useful comments.
References
- O. V. Borodin and A. O. Ivanova, List injective colorings of planar graphs, Discrete Math. 311 (2011), no. 2-3, 154-165. https://doi.org/10.1016/j.disc.2010.10.008
- Y. H. Bu, D. Chen, A. Raspaud, and W. Wang, Injective coloring of planar graphs, Discrete Appl. Math. 157 (2009), no. 4, 663-672. https://doi.org/10.1016/j.dam.2008.08.016
- Y. H. Bu and C. Huang, List injective coloring of a class of planar graphs without short cycles, Discrete Math. Algorithms Appl. 10 (2018), no. 5, 1850068, 12 pp. https://doi.org/10.1142/S1793830918500684
- Y. H. Bu and K. Lu, Injective coloring of planar graphs with girth 7, Discrete Math. Algorithms Appl. 4 (2012), no. 2, 1250034, 8 pp. https://doi.org/10.1142/S1793830912500346
- Y. H. Bu and K. Lu, List injective coloring of planar graphs with girth 5, 6, 8, Discrete Appl. Math. 161 (2013), no. 10-11, 1367-1377. https://doi.org/10.1016/j.dam.2012.12.017
- Y. H. Bu, C. Wang, and S. Yang, List injective coloring of planar graphs, Ars Combin. 141 (2018), 191-211.
- Y. H. Bu and S. Yang, List injective coloring of planar graphs with girth g ≥ 5, Discrete Math. Algorithms Appl. 6 (2014), no. 1, 1450006, 12 pp. https://doi.org/10.1142/S1793830914500062
- H. Y. Chen and J. L. Wu, List injective coloring of planar graphs with girth g ≥ 6, Discrete Math. 339 (2016), no. 12, 3043-3051. https://doi.org/10.1016/j.disc.2016.06.017
- D. W. Cranston, S.-J. Kim, and G. Yu, Injective colorings of sparse graphs, Discrete Math. 310 (2010), no. 21, 2965-2973. https://doi.org/10.1016/j.disc.2010.07.003
- D. W. Cranston, S.-J. Kim, and G. Yu, Injective colorings of graphs with low average degree, Algorithmica 60 (2011), no. 3, 553-568. https://doi.org/10.1007/s00453-010-9425-x
- D. Dimitrov, B. Luzar, and R.Skrekovski, Injective coloring of planar graphs with ∆ + 2 colors, preprint.
- W. Dong and W. Lin, Injective coloring of planar graphs with girth 6, Discrete Math. 313 (2013), no. 12, 1302-1311. https://doi.org/10.1016/j.disc.2013.02.014
- W. Dong and W. Lin, Injective coloring of plane graphs with girth 5, Discrete Math. 315 (2014), 120-127. https://doi.org/10.1016/j.disc.2013.10.017
- A. Doyon, G. Hahn, and A. Raspaud, Some bounds on the injective chromatic number of graphs, Discrete Math. 310 (2010), no. 3, 585-590. https://doi.org/10.1016/j.disc.2009.04.020
- G. Hahn, J. Kratochvil, J. Siran, and D. Sotteau, On the injective chromatic number of graphs, Discrete Math. 256 (2002), no. 1-2, 179-192. https://doi.org/10.1016/S0012-365X(01)00466-6
- R. Li and B. G. Xu, Injective choosability of planar graphs of girth five and six, Discrete Math. 312 (2012), no. 6, 1260-1265. https://doi.org/10.1016/j.disc.2011.10.029
- B. Luzar, Planar graphs with largest injective chromatic numbers, in: IMFM Preprint Series, 48, 2010, p. 1110.
- B. Luzar, R. Skrekovski, and M. Tancer, Injective colorings of planar graphs with few colors, Discrete Math. 309 (2009), no. 18, 5636-5649. https://doi.org/10.1016/j.disc.2008.04.005
- G. Wegner, Graphs with Given Diameter and a Coloring Problem, Technical Report, University of Dortmund, Germany, 1977.