# 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 :
Preprints, Working Papers, ...
Domain :
Complete list of metadatas

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 : Monday, January 20, 2020 - 3:08:45 PM

### File

1912.04634.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-02434695, version 1
• ARXIV : 1912.04634

### Citation

Christophe Picouleau. Minimal graphs for hamiltonian extension. 2020. ⟨hal-02434695⟩

Record views