Article contents
Edge-Maximal Graphs on Surfaces
Published online by Cambridge University Press: 20 November 2018
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).
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 2018
References
- 3
- Cited by