Contractile Triples in 3-Connected Graphs
Contractile Triples in 3-Connected Graphs
复制标题
三连通图中的收缩三元组
DOI：
10.1006/jctb.1994.1022
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
K. Ota
中科院分区：
文献类型：
--
作者：
W. McCuaig;K. Ota
我们证明了每一个至少为9阶的3连通图G都有两条相邻的边xy和yz，使得由G缩并x， y， z得到的图也是3连通的。
We prove that every 3-connected graph G of order at least nine has two adjacent edges xy and yz such that the graph obtained from G by contracting x, y, and z into a single vertex is also 3-connected.