Premium
Infinitely many planar cubic hypohamiltonian graphs of girth 5
Author(s) -
Goedgebeur Jan,
Zamfirescu Carol T.
Publication year - 2018
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22183
Subject(s) - combinatorics , cubic graph , mathematics , planar graph , foster graph , polyhedral graph , symmetric graph , discrete mathematics , outerplanar graph , vertex (graph theory) , odd graph , graph , coxeter graph , triangle free graph , line graph , graph power , 1 planar graph , pathwidth , voltage graph
A graph G is hypohamiltonian if G is non‐hamiltonian and for every vertex v in G , the graph G − v is hamiltonian. McKay asked in [ J. Graph Theory 85 (2017) 7–11] whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist. We settle this question affirmatively.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom