Zdeněk Dvořák, Luke Postle
Published 2020-10-04Version 1
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Comments: 13 pages, no figures
A proof for the decidability of HD0L ultimate periodicity
On the hyperbolicity of random graphs
On $r$-colorability of random hypergraphs
![QR code for arXiv:2010.01634 [math.CO]](http://oss.arxitics.com/images/favicon.svg)