On decidability of hyperbolicity
Combinatorics
2020-10-06 v1 Discrete Mathematics
Abstract
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Cite
@article{arxiv.2010.01634,
title = {On decidability of hyperbolicity},
author = {Zdeněk Dvořák and Luke Postle},
journal= {arXiv preprint arXiv:2010.01634},
year = {2020}
}
Comments
13 pages, no figures