Skip navigation
Skip navigation

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

Aldred, R E L; Baudin, S; Holton, D A; McKay, Brendan


We establish that if A is a set of at most 23 vertices in a 3-connected cubic planar graph G, then there is a cycle in G containing A. This result is sharp.

CollectionsANU Research Publications
Date published: 1999
Type: Journal article
Source: Graphs and Combinatorics


File Description SizeFormat Image
01_Aldred_Cycles_Through_23_Vertices_in_1999.pdf58.05 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator