Every graph occurs as an induced subgraph of some hypohamiltonian graph

DOI10.1002/jgt.22228zbMath1393.05095OpenAlexW2772041313MaRDI QIDQ4581282

Carol T. Zamfirescu, Tudor I. Zamfirescu

Publication date: 16 August 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22228

zbMATH Keywords

induced subgraphhypo-Hamiltonian graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ On a conjecture of Grünbaum on longest cycles ⋮ On a question of van Aardt et al. on destroying all longest cycles

This page was built for publication: Every graph occurs as an induced subgraph of some hypohamiltonian graph