The 3‐connected graphs having a longest cycle containing only three contractible edges
Robert E. L. Aldred, Robert L. Hemminger, Katsuhiro Ota · Journal of Graph Theory · 1993
Abstract 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.