A CONSTRUCTION OF 3-CONNECTED GRAPHS

被引:4
|
作者
BARNETTE, DW [1 ]
机构
[1] UNIV CALIF DAVIS, DEPT MATH, DAVIS, CA 95616 USA
关键词
D O I
10.1007/BF02773688
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that the 3-connected graphs can be generated from the complete graph on four vertices and the complete 3,3 bipartite graph by adding vertices and adding edges with endpoints on two edges meeting at a 3-valent vertex.
引用
收藏
页码:397 / 407
页数:11
相关论文
共 50 条
  • [41] Bisecting two subsets in 3-connected graphs
    Nagamochi, H
    Jordán, T
    Nakao, Y
    Ibaraki, T
    ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 425 - 434
  • [42] THE NUMBER OF POLYHEDRAL (3-CONNECTED PLANAR) GRAPHS
    DUIJVESTIJN, AJW
    FEDERICO, PJ
    MATHEMATICS OF COMPUTATION, 1981, 37 (156) : 523 - 532
  • [43] Chords of longest circuits in 3-connected graphs
    Li, XC
    Zhang, CQ
    DISCRETE MATHEMATICS, 2003, 268 (1-3) : 199 - 206
  • [44] Generation of 3-connected, planar line graphs
    Hollowbread-Smith, Phoebe
    Maffucci, Riccardo W.
    DISCRETE MATHEMATICS, 2025, 348 (02)
  • [45] Convex embeddings and bisections of 3-connected graphs
    Nagamochi, H
    Jordán, T
    Nakao, Y
    Ibaraki, T
    COMBINATORICA, 2002, 22 (04) : 537 - 554
  • [46] A note on 3-connected cubic planar graphs
    Lu, Xiaoyun
    DISCRETE MATHEMATICS, 2010, 310 (13-14) : 2054 - 2058
  • [47] Monotone Drawings of 3-Connected Plane Graphs
    He, Xin
    He, Dayu
    ALGORITHMS - ESA 2015, 2015, 9294 : 729 - 741
  • [48] NONREMOVABLE EDGES IN 3-CONNECTED CUBIC GRAPHS
    FOUQUET, JL
    THUILLIER, H
    GRAPHS AND COMBINATORICS, 1991, 7 (02) : 119 - 141
  • [49] Contractible Edges in 3-Connected Cubic Graphs
    Kou, Shuai
    Qin, Chengfu
    Yang, Weihua
    PARALLEL PROCESSING LETTERS, 2021, 31 (03)
  • [50] The number of polyhedral (3-connected planar) graphs
    Duijvestijn, AJW
    MATHEMATICS OF COMPUTATION, 1996, 65 (215) : 1289 - 1293