On decidability of hyperbolicity

arXiv2010.01634MaRDI QIDQ6350503FDOQ6350503

Authors: Zdeněk Dvořák, Luke Postle 

Publication date: 4 October 2020

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On decidability of hyperbolicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350503)