A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projective-planar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c(less-than-or-equal-to 120).
机构:
Nanning Normal Univ, Sch Math & Stat, Nanning 530001, Guangxi, Peoples R ChinaNanning Normal Univ, Sch Math & Stat, Nanning 530001, Guangxi, Peoples R China
Qin, Chengfu
Yang, Weihua
论文数: 0引用数: 0
h-index: 0
机构:
Taiyuan Univ Technol, Dept Math, Taiyuan 030024, Shanxi, Peoples R ChinaNanning Normal Univ, Sch Math & Stat, Nanning 530001, Guangxi, Peoples R China
机构:
Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
Guangxi Teachers Coll, Dept Math, Nanning 530001, Guangxi, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
Qin, Chengfu
Yuan, Xudong
论文数: 0引用数: 0
h-index: 0
机构:
Guangxi Normal Univ, Coll Math & Comp Sci, Guilin 541004, Guangxi, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China
Yuan, Xudong
Su, Hanji
论文数: 0引用数: 0
h-index: 0
机构:
Guangxi Normal Univ, Coll Math & Comp Sci, Guilin 541004, Guangxi, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R China