最大亏格、上可嵌入是图论中的两个重要概念。
Maximum genus and upper embeddable are two important conceptions in graph theory.
本文研究属第一个方面，即研究图的嵌入的最大亏格问题。
There are two fields in topological graph theory: one is the study of the properties of graph embedding.
本论文主要研究了图的最大亏格的下界问题以及有向图类在可定向曲面上嵌入的亏格分布。
In this paper, the lower bound problems of the maximum genus and the genus distributions of digraphs in orientable surfaces are studied.
本论文主要研究了图的最大亏格的下界问题以及有向图类在可定向曲面上嵌入的亏格分布。
In this paper, the lower bound problems of the maximum genus and the genus distributions of digraphs in orientable surfaces are studied.
应用推荐