On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable

DOI10.1002/jgt.22122zbMath1370.05115OpenAlexW2594573118MaRDI QIDQ5360885

Carol T. Zamfirescu

Publication date: 26 September 2017

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

Full work available at URL: http://hdl.handle.net/1854/LU-8531695

zbMATH Keywords

hypotraceable graphtraceable graphhypo-Hamiltonian graphnon-Hamiltonian graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Structural and computational results on platypus graphs ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ On minimum leaf spanning trees and a criticality notion ⋮ On a question of van Aardt et al. on destroying all longest cycles ⋮ On the size of maximally non-hamiltonian digraphs

This page was built for publication: On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable