Premium
The 3‐connected graphs having a longest cycle containing only three contractible edges
Author(s) -
Aldred R. E. L.,
Hemminger Robert L.,
Ota Katsuhiro
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170310
Subject(s) - combinatorics , mathematics , contractible space , discrete mathematics
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.