TY - JOUR
T1 - The 3‐connected graphs having a longest cycle containing only three contractible edges
AU - Aldred, R. E L
AU - Hemminger, Robert L.
AU - Ota, Katsuhiro
PY - 1993
Y1 - 1993
N2 - It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. © 1993 John Wiley & Sons, Inc.
AB - It is shown that with one small exception, the 3‐connected graphs admitting longest cycles that contain less than four contractible edges of the parent graph are the members of three closely related infinite families. © 1993 John Wiley & Sons, Inc.
UR - http://www.scopus.com/inward/record.url?scp=84987486538&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84987486538&partnerID=8YFLogxK
U2 - 10.1002/jgt.3190170310
DO - 10.1002/jgt.3190170310
M3 - Article
AN - SCOPUS:84987486538
SN - 0364-9024
VL - 17
SP - 361
EP - 371
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 3
ER -