A Size Bound for Hamilton Cycles
From MaRDI portal
Publication:6226534
Abstract: Every graph of size (the number of edges) and minimum degree is hamiltonian if . The result is sharp.
This page was built for publication: A Size Bound for Hamilton Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6226534)