Abstract : For every $n\ge 3$ we determine the minimum number of edges of graph with $n$ vertices such that for any non edge $xy$ there exits a hamiltonian cycle containing $xy$.
Christophe Picouleau. Minimal graphs for hamiltonian extension. Open Journal of Discrete Applied Mathematics, PSR Press, 2020, ⟨10.30538/psrp-odam2020.0026⟩. ⟨hal-02434695⟩