Cycles through 23 vertices in 3-connected cubic planar graphs

R. E.L. Aldred; S. Bau; D. A. Holton; Brendan D. McKay

doi:10.1007/s003730050046

Cycles through 23 vertices in 3-connected cubic planar graphs

R. E.L. Aldred^*, S. Bau, D. A. Holton, Brendan D. McKay

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

13 Citations (Scopus)

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.

Original language	English
Pages (from-to)	373-376
Number of pages	4
Journal	Graphs and Combinatorics
Volume	15
Issue number	4
DOIs	https://doi.org/10.1007/s003730050046
Publication status	Published - 1999

Access to Document

10.1007/s003730050046

Cite this

@article{e890b171297c462ab4e156d0f390437d,

title = "Cycles through 23 vertices in 3-connected cubic planar graphs",

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.",

author = "Aldred, {R. E.L.} and S. Bau and Holton, {D. A.} and McKay, {Brendan D.}",

year = "1999",

doi = "10.1007/s003730050046",

language = "English",

volume = "15",

pages = "373--376",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "4",

}

TY - JOUR

T1 - Cycles through 23 vertices in 3-connected cubic planar graphs

AU - Aldred, R. E.L.

AU - Bau, S.

AU - Holton, D. A.

AU - McKay, Brendan D.

PY - 1999

Y1 - 1999

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

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

UR - http://www.scopus.com/inward/record.url?scp=0043253140&partnerID=8YFLogxK

U2 - 10.1007/s003730050046

DO - 10.1007/s003730050046

M3 - Article

SN - 0911-0119

VL - 15

SP - 373

EP - 376

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 4

ER -

Cycles through 23 vertices in 3-connected cubic planar graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this