Edge‐maximal graphs on orientable and some nonorientable surfaces
Edge‐maximal graphs on orientable and some nonorientable surfaces
复制标题
DOI:
10.1002/jgt.22705
复制
发表时间:
2019-11
影响因子:
0.9
通讯作者:
James Davies;Florian Pfender
中科院分区:
文献类型:
--
作者:
James Davies;Florian Pfender
We study edge‐maximal, noncomplete graphs on surfaces that do not triangulate the surface. We prove that there is no such graph on the projective plane N 1 , K 7 − e is the unique such graph on the Klein bottle N 2 and K 8 − E ( C 5 ) is the unique such graph on the torus S 1 . In contrast to this for each g ≥ 2 we construct an infinite family of such graphs on the orientable surface S g of genus g , that are ⌊ g 2 ⌋ edges short of a triangulation.