Sufficient conditions for planar graphs to be 2-distance ($\text{Δ}+1$)-colourable.

Borodin, O.V., et al. "Sufficient conditions for planar graphs to be 2-distance ()-colourable.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 1 (2004): 129-141. <http://eudml.org/doc/51820>.

@article{Borodin2004,
author = {Borodin, O.V., Glebov, A.N., Ivanova, A.O., Neustroeva, T.K., Tashkinov, V.A.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {coloring; diameter; chromatic number},
language = {eng},
pages = {129-141},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {Sufficient conditions for planar graphs to be 2-distance ()-colourable.},
url = {http://eudml.org/doc/51820},
volume = {1},
year = {2004},
}

TY - JOUR
AU - Borodin, O.V.
AU - Glebov, A.N.
AU - Ivanova, A.O.
AU - Neustroeva, T.K.
AU - Tashkinov, V.A.
TI - Sufficient conditions for planar graphs to be 2-distance ()-colourable.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2004
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 1
SP - 129
EP - 141
LA - eng
KW - coloring; diameter; chromatic number
UR - http://eudml.org/doc/51820
ER -