Electronic International Standard Serial Number (EISSN)
We prove that under appropriate assumptions adding or removing an infinite amount of edges to a given planar graph preserves its non-hyperbolicity, a result which is shown to be false in general. In particular, we make a conjecture that every tessellation graph of a"e(2) with convex tiles is non-hyperbolic; it is shown that in order to prove this conjecture it suffices to consider tessellation graphs of a"e(2) such that every tile is a triangle and a partial answer to this question is given. A weaker version of this conjecture stating that every tessellation graph of a"e(2) with rectangular tiles is non-hyperbolic is given and partially answered. If this conjecture were true, many tessellation graphs of a"e(2) with tiles which are parallelograms would be non-hyperbolic.