Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.
Borodin, O.V.; Glebov, A.N.; Jensen, Tommy R.; Raspaud, Andre
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2006)
- Volume: 3, page 428-440
- ISSN: 1813-3304
Access Full Article
top
How to cite
topBorodin, O.V., et al. "Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 3 (2006): 428-440. <http://eudml.org/doc/53348>.
@article{Borodin2006,
author = {Borodin, O.V., Glebov, A.N., Jensen, Tommy R., Raspaud, Andre},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {color-4-critical graph; Euler's formula; plane graph without triangles},
language = {eng},
pages = {428-440},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.},
url = {http://eudml.org/doc/53348},
volume = {3},
year = {2006},
}
TY - JOUR
AU - Borodin, O.V.
AU - Glebov, A.N.
AU - Jensen, Tommy R.
AU - Raspaud, Andre
TI - Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2006
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 3
SP - 428
EP - 440
LA - eng
KW - color-4-critical graph; Euler's formula; plane graph without triangles
UR - http://eudml.org/doc/53348
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.