3-coloring triangle-free planar graphs with a precolored 9-cycle
Date
2018-02-01
Authors
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Series Number
Journal Issue
Is Version Of
Versions
Series
Academic or Administrative Unit
Type
article
Comments
This is a manuscript of an article published as Choi, Ilkyoo, Jan Ekstein, Přemysl Holub, and Bernard Lidický. "3-coloring triangle-free planar graphs with a precolored 9-cycle." 68 European Journal of Combinatorics (2018): 38-65. doi: 10.1016/j.ejc.2017.07.010. Posted with permission.
Rights Statement
Copyright
Sun Jan 01 00:00:00 UTC 2017