Journal title
Canadian Journal of Mathematics
DOI
10.4153/CJM-2017-028-0
Issue
4
Volume
70
Last updated
2022-03-06T08:39:08.763+00:00
Page
925-942
Abstract
We prove that for every surface Σ of Euler genus g, every edgemaximal embedding of a graph in Σ is at most O(g) edges short of a triangulation of Σ. This provides the first answer to an open problem of Kainen (1974).
Symplectic ID
707579
Submitted to ORA
On
Publication type
Journal Article
Publication date
2 October 2017