Hamiltonian path saturated graphs with small size (Q2492212): Difference between revisions

A graph \(G\) is Hamiltonian path saturated if \(G\) has no Hamiltonian path and any addition of a new edge in \(G\) creates a Hamiltonian path in \(G\). The authors establish a lower bound for the minimum size of a Hamiltonian path saturated graph for a given order. Small size path-cover saturated graphs are also considered.