Back to Search
Start Over
On 3-colorable planar graphs without short cycles
- Source :
-
Applied Mathematics Letters . Sep2008, Vol. 21 Issue 9, p961-965. 5p. - Publication Year :
- 2008
-
Abstract
- Abstract: In this paper, we prove that planar graphs without -cycles and without two 5-cycles sharing exactly one edge are 3-colorable. This improves the result in [O.V. Borodin, A.N. Glebov, A. Raspaud, M.R. Salavatipour, Planar graphs without cycles of length from 4 to 7 are 3-colorable, J. Combin. Theory Ser. B 93 (2005) 303–311]. [Copyright &y& Elsevier]
- Subjects :
- *GRAPHIC methods
*MATHEMATICS
*MECHANICAL drawing
*GEOMETRICAL drawing
Subjects
Details
- Language :
- English
- ISSN :
- 08939659
- Volume :
- 21
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics Letters
- Publication Type :
- Academic Journal
- Accession number :
- 33343687
- Full Text :
- https://doi.org/10.1016/j.aml.2007.10.010