Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs
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.
|Collections||ANU Research Publications|
|Source:||Graphs and Combinatorics|
|01_Aldred_Cycles_Through_23_Vertices_in_1999.pdf||58.05 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.