Skip to main content

1 Result(s)

within Přemysl Holub Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle

    Given a triangle-free planar graph G and a cycle C of length 9 in G, we characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results for the lengt...

    Ilkyoo Choi, Jan Ekstein, Přemysl Holub, Bernard Lidický in Combinatorial Algorithms (2015)