Skip to main content
SpringerLink
Log in

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Department of Mathematics and Statistics, University of Otago, P.O. Box 56, Dunedin, New Zealand. e-mail: raldred@maths.otago.ac.nz; dholton@maths.otago.ac.nz, , , , , , NZ

    R. E. L. Aldred, S. Bau & D. A. Holton

  2.  Department of Computer Science, Australian National University, Canberra, ACT 0200, Australia. e-mail: bdm@cs.anu.edu.au, , , , , , AU

    Brendan D. McKay

Authors
  1. R. E. L. Aldred
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Bau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. A. Holton
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Brendan D. McKay
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: September 1, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aldred, R., Bau, S., Holton, D. et al. Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. Graphs Comb 15, 373–376 (1999). https://doi.org/10.1007/s003730050046

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050046

Keywords

Search

Navigation