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$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
