Oct 4, 2020 · Abstract:We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of ...

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

ON DECIDABILITY OF HYPERBOLICITY. 1085. Consider a class G of graphs drawn on surfaces. The class G is hyperbolic if there exists a constant cG > 0 such that ...

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

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

On decidability of hyperbolicity. Zdenek Dvorák. (joint work with Luke Postle). We prove that a wide range of coloring problems in graphs on surfaces ...

A graph is locally-connected if the neighborhood of each vertex induces a connected graph. It is well known that a triangulation on a closed surface is locally- ...

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

Aug 9, 2019 · The aim of this short note is to provide a proof of the decidability of the generalized membership problem for relatively quasi-convex subgroups ...

Let Γ be a non-elementary torsion-free hyperbolic group. We consider formulas in the language LA that contains generators of Γ as constants.