upper-embeddable 上可嵌入
If the upper bound on the maximum genus of a graph G can arrive at the best value β(G)/2, then we call such a graph G is upper embeddable.
如果一个图的最大亏格能够取到最好的上界β(G)/2,则这个图就是上可嵌入的。
参考来源 - 关于图的上可嵌入性研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Maximum genus and upper embeddable are two important conceptions in graph theory.
最大亏格、上可嵌入是图论中的两个重要概念。
In the paper, we prove a graph which satisfies the Fan's condition is upper embeddable by a sufficient and necessary condition on non-upper embeddable graphs.
文章利用关于不是上可嵌入图的充要条件，证明了范条件图是上可嵌入的。
Combining with the condition of C-partition and tetragon 2-factor, we give new classes of upper-embeddable graphs.
联系图的顶点划分和四边形2因子的条件，本文给出了新的上可嵌入的图类。
应用推荐