Edge-Maximal Graphs on Surfaces
Canadian journal of mathematics, Tome 70 (2018) no. 4, pp. 925-942
Voir la notice de l'article provenant de la source Cambridge
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).
McDiarmid, Colin; Wood, David R. Edge-Maximal Graphs on Surfaces. Canadian journal of mathematics, Tome 70 (2018) no. 4, pp. 925-942. doi: 10.4153/CJM-2017-028-0
@article{10_4153_CJM_2017_028_0,
author = {McDiarmid, Colin and Wood, David R.},
title = {Edge-Maximal {Graphs} on {Surfaces}},
journal = {Canadian journal of mathematics},
pages = {925--942},
year = {2018},
volume = {70},
number = {4},
doi = {10.4153/CJM-2017-028-0},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-2017-028-0/}
}
Cité par Sources :