Premium
An 11‐vertex theorem for 3‐connected cubic graphs
Author(s) -
Aldred R. E. L.,
Holton D. A.,
Royle Gordon F.
Publication year - 1988
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.3190120412
Subject(s) - combinatorics , mathematics , vertex (graph theory) , cubic graph , pancyclic graph , independent set , discrete mathematics , graph , 1 planar graph , chordal graph , line graph , voltage graph
In this paper we determine the circumstances under which a set of 11 vertices in a 3‐connected cubic graph lies on a cycle. In addition, we consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.