Generalizations of the classics to spanning connectedness

作者：

Highlights：

• Some classic results about Hamiltonicity of graphs are generalized to spanning connectedness.

• Extremal number of edges, which can guarantee that a graph to be spanning connected, was determined.

摘要

•Some classic results about Hamiltonicity of graphs are generalized to spanning connectedness.•Extremal number of edges, which can guarantee that a graph to be spanning connected, was determined.

论文关键词：Hamiltonicity,Spanning connectedness,Extremal problem,Chvátal-Erdős theorem

论文评审过程：Received 8 August 2020, Revised 28 February 2021, Accepted 4 March 2021, Available online 19 March 2021, Version of Record 19 March 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126167