On Decidability of Hyperbolicity

Abstrakt

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

Klíčová slova

• Decidability
• Hyperbolicity