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).
机构:
Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
Jimei Univ, Sch Sci, Xiamen 361021, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
Xu, Liqiong
Guo, Xiaofeng
论文数: 0引用数: 0
h-index: 0
机构:
Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R ChinaXiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
机构:
Res Org Informat & Syst, Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, JapanRes Org Informat & Syst, Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan
Kawarabayashi, Ken-ichi
Ozeki, Kenta
论文数: 0引用数: 0
h-index: 0
机构:
Res Org Informat & Syst, Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, JapanRes Org Informat & Syst, Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan