Hamiltonian extendable graphs (Q2151217)

A graph is Hamiltonian extendable if each pair of nonadjacent vertices can be extended to a Hamiltonian cycle. The authors establish the minimum number of edges for Hamiltonian extendable graphs, characterize the degree sequence for Hamiltonian extendable graphs with a minimum number of edges, and characterize the pairs of forbidden subgraphs for 2-connected graphs to be Hamiltonian extendable.