Campus Units

Mathematics

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

2-2018

Journal or Book Title

European Journal of Combinatorics

Volume

68

First Page

38

Last Page

65

DOI

10.1016/j.ejc.2017.07.010

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.

Comments

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.

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Copyright Owner

Elsevier Ltd.

Language

en

File Format

application/pdf

Published Version

Included in

Mathematics Commons

Share

COinS