While, the determination of a graph's upper embeddablity is to determine a graph's maximum genus.
而确定一类图的上可嵌入性问题本身就是确定图的最大亏格问题。
·2,447,543篇论文数据，部分数据来源于NoteExpress
Maximum genus and upper embeddable are two important conceptions in graph theory.
最大亏格、上可嵌入是图论中的两个重要概念。
youdao
In this paper, the lower bound problems of the maximum genus and the genus distributions of digraphs in orientable surfaces are studied.
本论文主要研究了图的最大亏格的下界问题以及有向图类在可定向曲面上嵌入的亏格分布。
应用推荐
模块上移
模块下移
不移动