Minimal graphs for hamiltonian extension

1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
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$.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [3 references]

https://hal.archives-ouvertes.fr/hal-02434695
Contributor : Christophe Picouleau <>
Submitted on : Friday, January 17, 2020 - 12:32:57 PM
Last modification on : Friday, August 21, 2020 - 1:56:05 PM

File

1912.04634.pdf
Files produced by the author(s)

Citation

Christophe Picouleau. Minimal graphs for hamiltonian extension. Open Journal of Discrete Applied Mathematics, PSR Press, 2020, ⟨10.30538/psrp-odam2020.0026⟩. ⟨hal-02434695⟩

Record views