Pairs of Hamiltonian circuits in 5-connected planar graphs

Joseph Zaks

doi:10.1016/0095-8956(76)90051-4

Pairs of Hamiltonian circuits in 5-connected planar graphs

Joseph Zaks

Department of Mathematics

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

Abstract

Settling a problem raised by B. Grünbaum, J. Malkevitch, and the author, we present 5-valent 5-connected planar graphs that admit no pairs of edgedisjoint Hamiltonian circuits; our smallest example has 176 vertices. This is used to construct an infinite family of 5-valent 5-connected planar graphs, in which every member has the property that any pair of Hamiltonian circuits in it share at least about 1 168 of their edges. We construct 4- and 5-valent, 3-connected non-Hamiltonian planar graphs.

Original language	English
Pages (from-to)	116-131
Number of pages	16
Journal	Journal of Combinatorial Theory. Series B
Volume	21
Issue number	2
DOIs	https://doi.org/10.1016/0095-8956(76)90051-4
State	Published - Oct 1976

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(76)90051-4

Cite this

@article{55aee7771dc143388142d658257a9e43,

title = "Pairs of Hamiltonian circuits in 5-connected planar graphs",

abstract = "Settling a problem raised by B. Gr{\"u}nbaum, J. Malkevitch, and the author, we present 5-valent 5-connected planar graphs that admit no pairs of edgedisjoint Hamiltonian circuits; our smallest example has 176 vertices. This is used to construct an infinite family of 5-valent 5-connected planar graphs, in which every member has the property that any pair of Hamiltonian circuits in it share at least about 1 168 of their edges. We construct 4- and 5-valent, 3-connected non-Hamiltonian planar graphs.",

author = "Joseph Zaks",

year = "1976",

month = oct,

doi = "10.1016/0095-8956(76)90051-4",

language = "English",

volume = "21",

pages = "116--131",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Pairs of Hamiltonian circuits in 5-connected planar graphs

AU - Zaks, Joseph

PY - 1976/10

Y1 - 1976/10

N2 - Settling a problem raised by B. Grünbaum, J. Malkevitch, and the author, we present 5-valent 5-connected planar graphs that admit no pairs of edgedisjoint Hamiltonian circuits; our smallest example has 176 vertices. This is used to construct an infinite family of 5-valent 5-connected planar graphs, in which every member has the property that any pair of Hamiltonian circuits in it share at least about 1 168 of their edges. We construct 4- and 5-valent, 3-connected non-Hamiltonian planar graphs.

AB - Settling a problem raised by B. Grünbaum, J. Malkevitch, and the author, we present 5-valent 5-connected planar graphs that admit no pairs of edgedisjoint Hamiltonian circuits; our smallest example has 176 vertices. This is used to construct an infinite family of 5-valent 5-connected planar graphs, in which every member has the property that any pair of Hamiltonian circuits in it share at least about 1 168 of their edges. We construct 4- and 5-valent, 3-connected non-Hamiltonian planar graphs.

UR - https://www.scopus.com/pages/publications/0038282292

U2 - 10.1016/0095-8956(76)90051-4

DO - 10.1016/0095-8956(76)90051-4

M3 - Article

AN - SCOPUS:0038282292

SN - 0095-8956

VL - 21

SP - 116

EP - 131

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 2

ER -

Pairs of Hamiltonian circuits in 5-connected planar graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this