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 条
  • [21] Removable edges in a 5-connected graph and a construction method of 5-connected graphs
    Xu, Liqiong
    Guo, Xiaofeng
    DISCRETE MATHEMATICS, 2008, 308 (09) : 1726 - 1731
  • [22] The contractible subgraph of 5-connected graphs
    Qin, Chengfu
    Guo, Xiaofeng
    Yang, Weihua
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2013, 63 (03) : 671 - 677
  • [23] Induced paths in 5-connected graphs
    Kriesell, M
    JOURNAL OF GRAPH THEORY, 2001, 36 (01) : 52 - 58
  • [24] Counting 5-connected planar triangulations
    Gao, ZCJ
    Wanless, IM
    Wormald, NC
    JOURNAL OF GRAPH THEORY, 2001, 38 (01) : 18 - 35
  • [25] 5-Shredders in 5-connected graphs
    Egawa, Yoshimi
    Okadome, Yumiko
    Takatou, Masanori
    DISCRETE MATHEMATICS, 2009, 309 (06) : 1565 - 1574
  • [26] The contractible subgraph of 5-connected graphs
    Chengfu Qin
    Xiaofeng Guo
    Weihua Yang
    Czechoslovak Mathematical Journal, 2013, 63 : 671 - 677
  • [27] Classification of Finite Groups with Toroidal or Projective-Planar Permutability Graphs
    Rajkumar, R.
    Devi, P.
    Gagarin, Andrei
    COMMUNICATIONS IN ALGEBRA, 2016, 44 (09) : 3705 - 3726
  • [28] 5-CONNECTED TOROIDAL GRAPHS ARE HAMILTONIAN-CONNECTED
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (01) : 112 - 140
  • [29] Finite groups whose intersection power graphs are toroidal and projective-planar
    Li, Huani
    Ma, Xuanlong
    Fu, Ruiqin
    OPEN MATHEMATICS, 2021, 19 (01): : 850 - 862
  • [30] A Local Structure Theorem on 5-Connected Graphs
    Ando, Kiyoshi
    JOURNAL OF GRAPH THEORY, 2009, 60 (02) : 99 - 129