Minimal graphs for hamiltonian extension

Christophe Picouleau (1)

1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire

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$.

Mots clés: 2-factor; hamiltonian cycle; hamiltonian path

Domaines: Informatique [cs]; Combinatoire [math.CO]; Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

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