Dec 3, 2014 · 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 ...

May 11, 2013 · 3-coloring triangle-free planar graphs with a precolored 8-cycle ... Let G be a planar triangle-free graph and let C be a cycle in G of.

May 11, 2013 · 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 ...

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 ...

Dec 3, 2014 · 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 ...

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 ...

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 ...

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 ...

Sep 6, 2016 · Theorem (Grötzsch '59). Let G be a triangle-free plane graph and F be the outer face of G of length at most 5. Then each 3-coloring of F can ...

Bibliographic details on 3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle.