Author:
McDiarmid Colin,Wood David R.
Abstract
AbstractWe prove that for every surface ∑ of Euler genus g, every edge-maximal 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).
Publisher
Canadian Mathematical Society
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献