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.
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Xiong, Wei
Zhang, Zhao
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Zhang, Zhao
Lai, Hong-Jian
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
W Virginia Univ, Dept Math, Morgantown, WV 26506 USAXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
机构:
Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, 1-3 Kagurazaka, Tokyo 1628601, JapanTokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, 1-3 Kagurazaka, Tokyo 1628601, Japan