The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。