Article
3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle
Journal of Graph Theory
Document Type
Article
Disciplines
Publication Version
Accepted Manuscript
Publication Date
10-1-2015
DOI
10.1002/jgt.21842
Abstract
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.
Copyright Owner
Wiley Periodicals, Inc.
Copyright Date
2014
Language
en
File Format
application/pdf
Citation Information
zdeněk dvořák and Bernard Lidicky. "3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle" Journal of Graph Theory Vol. 80 Iss. 2 (2015) p. 98 - 111 Available at: http://works.bepress.com/bernard-lidicky/40/
This is the peer-reviewed version of the following article: dvořák, zdeněk and Bernard Lidický. "3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle." Journal of Graph Theory 80, no. 2 (2015): 98-111, which has been published in final form at doi: 10.1002/jgt.21842. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving. Posted with permission.