On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable
On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable
Abstract We call a graph G a platypus if G is non‐hamiltonian, and for any vertex v in G , the graph is traceable. Every hypohamiltonian and every hypotraceable graph is a platypus, but there exist platypuses that are neither hypohamiltonian nor hypotraceable. Among other things, we give a sharp …