Minimal graphs for hamiltonian extension

arXiv1912.04634MaRDI QIDQ6330833FDOQ6330833

Christophe Picouleau

Publication date: 10 December 2019

Abstract: For every $nge3$ 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$.

This page was built for publication: Minimal graphs for hamiltonian extension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330833)