Portal de Periódicos da CAPES

An 11‐vertex theorem for 3‐connected cubic graphs

1988; Wiley; Volume: 12; Issue: 4 Linguagem: Inglês

10.1002/jgt.3190120412

1097-0118

R. E. L. Aldred, BauSheng, Derek Holton, Gordon Royle,

Graph Labeling and Dimension Problems

Abstract 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.