arXiv Open Access 2019

Minimal graphs for hamiltonian extension

Christophe Picouleau

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

math.CO

Penulis (1)

Christophe Picouleau

Format Sitasi

APA MLA BibTeX

Picouleau, C. (2019). Minimal graphs for hamiltonian extension. https://arxiv.org/abs/1912.04634

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓