TY - JOUR
T1 - Longest cycles in 3‐connected graphs contain three contractible edges
AU - Dean, Nathaniel
AU - Hemminger, Robert L.
AU - Ota, Katsuhiro
PY - 1989
Y1 - 1989
N2 - We show that if G is a 3‐connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges.
AB - We show that if G is a 3‐connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges.
UR - http://www.scopus.com/inward/record.url?scp=84986486999&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84986486999&partnerID=8YFLogxK
U2 - 10.1002/jgt.3190130105
DO - 10.1002/jgt.3190130105
M3 - Article
AN - SCOPUS:84986486999
VL - 13
SP - 17
EP - 21
JO - Journal of Graph Theory
JF - Journal of Graph Theory
SN - 0364-9024
IS - 1
ER -