BOUNDING THE NUMBER OF EMBEDDINGS OF 5-CONNECTED PROJECTIVE-PLANAR GRAPHS

被引:0
|
作者
KITAKUBO, S
机构
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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).
引用
收藏
页码:197 / 205
页数:9
相关论文
共 50 条
  • [31] Removable edges of cycles in 5-connected graphs
    Kang H.
    Wu J.
    Li G.
    Journal of Applied Mathematics and Computing, 2008, 28 (1-2) : 93 - 106
  • [32] Projective-Planar Graphs with No K3, 4-Minor
    Maharry, John
    Slilaty, Daniel
    JOURNAL OF GRAPH THEORY, 2012, 70 (02) : 121 - 134
  • [33] CONTRACTIBLE SUBGRAPHS OF QUASI 5-CONNECTED GRAPHS
    Kou, Shuai
    Yang, Weihua
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024,
  • [34] Hamilton cycles in 5-connected line graphs
    Kaiser, Tomas
    Vrana, Petr
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (05) : 924 - 947
  • [35] Projective-Planar Graphs with no K3, 4-Minor. II
    Maharry, John
    Slilaty, Daniel
    JOURNAL OF GRAPH THEORY, 2017, 86 (01) : 92 - 103
  • [36] The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
    Tingting Li
    Jianji Su
    Graphs and Combinatorics, 2010, 26 : 395 - 406
  • [37] Triangles in contraction critical 5-connected graphs
    Qin Chengfu
    Yuan Xudong
    Su Jianji
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 33 : 139 - 146
  • [38] The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
    Li, Tingting
    Su, Jianji
    GRAPHS AND COMBINATORICS, 2010, 26 (03) : 395 - 406
  • [39] The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs
    Qin, Chengfu
    Guo, Xiaofeng
    Ando, Kiyoshi
    GRAPHS AND COMBINATORICS, 2015, 31 (01) : 243 - 254
  • [40] The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs
    Chengfu Qin
    Xiaofeng Guo
    Kiyoshi Ando
    Graphs and Combinatorics, 2015, 31 : 243 - 254