Minimal graphs for hamiltonian extension - Archive ouverte HAL Access content directly
Journal Articles Open Journal of Discrete Applied Mathematics Year : 2020

Minimal graphs for hamiltonian extension

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$.
Fichier principal
Vignette du fichier
1912.04634.pdf (223.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02434695 , version 1 (17-01-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More