Citation:
O. V. Borodin, A. O. Ivanova, T. K. Neustroeva, “Предписанная 2-дистанционная (Δ+1)-раскраска плоских графов с заданным обхватом”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007), 13–30; J. Appl. Industr. Math., 2:3 (2008), 317–328
This publication is cited in the following 22 articles:
Hoang La, Mickael Montassier, “2-Distance (Δ + 1)-coloring of sparse graphs using the potential method”, Discrete Mathematics, 348:1 (2025), 114292
Yin-dong Jin, Lian-ying Miao, “List 2-distance Coloring of Planar Graphs with Girth Five”, Acta Math. Appl. Sin. Engl. Ser., 38:3 (2022), 540
La H., Montassier M., Pinlou A., Valicov P., “R-Hued (R+1)-Coloring of Planar Graphs With Girth At Least 8 For R >= 9”, Eur. J. Comb., 91 (2021), 103219
Bonamy M., Leveque B., Pinlou A., “List Coloring the Square of Sparse Graphs with Large Degree”, Eur. J. Comb., 41 (2014), 128–137
Bonamy M., Leveque B., Pinlou A., “Graphs with Maximum Degree Delta >= 17 and Maximum Average Degree Less Than 3 Are List 2-Distance (Delta+2)-Colorable”, Discrete Math., 317 (2014), 19–32
Cranston D.W. Skrekovski R., “Sufficient Sparseness Conditions for G(2) to Be (Delta+1)-Choosable, When Delta >= 5”, Discrete Appl. Math., 162 (2014), 167–176
Zhu H., Hou L., Chen W., Lu X., “The l(P, Q)-Labelling of Planar Graphs Without 4-Cycles”, Discrete Appl. Math., 162 (2014), 355–363
Bonamy M. Leveque B. Pinlou A., “2-Distance Coloring of Sparse Graphs”, J. Graph Theory, 77:3 (2014), 190–218
Borodin O.V., “Colorings of Plane Graphs: a Survey”, Discrete Math., 313:4 (2013), 517–539
Bu Yu., Lu K., “List Injective Coloring of Planar Graphs with Girth 5, 6, 8”, Discrete Appl. Math., 161:10-11 (2013), 1367–1377
Weifan Wang, Yuehua Bu, Handbook of Combinatorial Optimization, 2013, 2095
Borodin O.V., Ivanova A.O., Montassier M., Raspaud A., “(k, 1)-coloring of sparse graphs”, Discrete Math, 312:6 (2012), 1128–1135
Li R., Xu B., “Injective choosability of planar graphs of girth five and six”, Discrete Math, 312:6 (2012), 1260–1265
Borodin O.V., Ivanova A.O., “List 2-facial 5-colorability of plane graphs with girth at least 12”, Discrete Math, 312:2 (2012), 306–314
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou, “2-distance coloring of sparse graphs”, Electronic Notes in Discrete Mathematics, 38 (2011), 155
A. O. Ivanova, “Predpisannaya 2-distantsionnaya (Δ+1)-raskraska ploskikh grafov s obkhvatom ne menee 7”, Diskretn. analiz i issled. oper., 17:5 (2010), 22–36
Cranston D.W., Kim Seog-Jin, Yu Gexin, “Injective colorings of sparse graphs”, Discrete Math., 310:21 (2010), 2965–2973
O. V. Borodin, A. O. Ivanova, “List 2-distance (Δ+2)-coloring of planar graphs with girth 6 and Δ⩾24”, Siberian Math. J., 50:6 (2009), 958–964