Back to Search
Start Over
PLANAR GRAPHS WITHOUT 7-CYCLES ARE 4-CHOOSABLE.
- Source :
- SIAM Journal on Discrete Mathematics; 2009, Vol. 23 Issue 3, p1179-1199, 21p, 7 Diagrams
- Publication Year :
- 2009
-
Abstract
- In this paper, we show that every planar graph without 7-cycles is 4-choosable. [ABSTRACT FROM AUTHOR]
- Subjects :
- CONFIGURATIONS (Geometry)
CYCLES
STANDARDS of length
ALGORITHMS
LOGICAL prediction
Subjects
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 23
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 51706855
- Full Text :
- https://doi.org/10.1137/05064477X