Edge-Maximal Graphs on Surfaces

Abstract

We prove that for every surface $\Sigma$ of Euler genus $g$, every edge-maximal embedding of a graph in $\Sigma$ is at most $O(g)$ edges short of a triangulation of $\Sigma$. This provides the first answer to an open problem of Kainen (1974).

Cited by in corpus (1)

• Robust Connectivity of Graphs on Surfaces