3-coloring triangle-free planar graphs with a precolored 9-cycle
Given a triangle-free planar graph G and a cycle C of length 9 in G, we characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results for the length of C up to 8.
- Publisher
- Springer Verlag
- Issue Date
- 2014-10
- Language
- English
- Citation
25th International Workshop on Combinatorial Algorithms, IWOCA 2014, pp.98 - 109
- ISSN
- 0302-9743
- Appears in Collection
- RIMS Conference Papers
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.