TY - JOUR
T1 - Contractile triples in 3-connected graphs
AU - McCuaig, William
AU - Ota, Katsuhiro
PY - 1994/3
Y1 - 1994/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0000467302&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0000467302&partnerID=8YFLogxK
U2 - 10.1006/jctb.1994.1022
DO - 10.1006/jctb.1994.1022
M3 - Article
AN - SCOPUS:0000467302
SN - 0095-8956
VL - 60
SP - 308
EP - 314
JO - Journal of Combinatorial Theory, Series B
JF - Journal of Combinatorial Theory, Series B
IS - 2
ER -