Every graph occurs as an induced subgraph of some hypohamiltonian graph
We prove the titular statement. This settles a problem of Chvátal from 1973 and encompasses earlier results of Thomassen, who showed it for K3, and Collier and Schmeichel, who proved it for bipartite graphs. We also show that for every outerplanar graph there exists a planar hypohamiltonian graph co...
Saved in:
Published in | Journal of graph theory Vol. 88; no. 4; pp. 551 - 557 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Hoboken
Wiley Subscription Services, Inc
01.08.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We prove the titular statement. This settles a problem of Chvátal from 1973 and encompasses earlier results of Thomassen, who showed it for K3, and Collier and Schmeichel, who proved it for bipartite graphs. We also show that for every outerplanar graph there exists a planar hypohamiltonian graph containing it as an induced subgraph. |
---|---|
ISSN: | 0364-9024 1097-0118 |
DOI: | 10.1002/jgt.22228 |