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.
机构:
W Virginia Univ, Dept Math, Morgantown, WV 26506 USAW Virginia Univ, Dept Math, Morgantown, WV 26506 USA
Chen, Ye
Fan, Suohai
论文数: 0引用数: 0
h-index: 0
机构:
Jinan Univ, Dept Math, Guangzhou, Guangdong, Peoples R ChinaW Virginia Univ, Dept Math, Morgantown, WV 26506 USA
Fan, Suohai
Lai, Hong-Jian
论文数: 0引用数: 0
h-index: 0
机构:
W Virginia Univ, Dept Math, Morgantown, WV 26506 USA
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaW Virginia Univ, Dept Math, Morgantown, WV 26506 USA