On decidability of hyperbolicity

10/04/2020

∙

by   Zdeněk Dvořák, et al.

∙

0

∙

share

We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.