Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903643 | European Journal of Combinatorics | 2018 | 28 Pages |
Abstract
Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results when C is a cycle of length at most 8.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ilkyoo Choi, Jan Ekstein, PÅemysl Holub, Bernard Lidický,