Minimal graphs for hamiltonian extension
Résumé
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$.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...