paper

On decidability of hyperbolicity

arXiv:2010.01634

Abstract

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

13 pages, no figures