Minimal graphs for hamiltonian extension
Abstract
For every n 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.