Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs
Date
1999
Authors
Aldred, R E L
Baudin, S
Holton, D A
McKay, Brendan
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
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.
Description
Keywords
Citation
Collections
Source
Graphs and Combinatorics
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31
Downloads
File
Description