Year: 2019
Type: preprint
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$.
Source: arXiv (Cornell University)
Author: Picouleau, Christophe
Institution: Conservatoire National des Arts et Métiers
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2995453094