Subhamiltonian graph

A **subhamiltonian graph** is a type of graph in the field of graph theory. Specifically, a subhamiltonian graph is one that contains a Hamiltonian path but not necessarily a Hamiltonian cycle. In other words, it is possible to traverse all vertices in the graph exactly once (the definition of a Hamiltonian path), but it may not be possible to return to the starting vertex without repeating any vertices (which would be needed for a Hamiltonian cycle).