A note on the 2-power of Hamilton cycles

作者：Khan, Zia Ullah; Yuan, Long-Tu^*

来源：Discrete Mathematics, 2022, 345(8): 112908.

DOI：10.1016/j.disc.2022.112908

• 2-power of graphs
• Hamilton cycle

We determine the maximum number of edges of a graph without containing the 2-power of a Hamilton cycle. This extends a well-known theorem of Ore in 1961 concerning the maximum number of edges of a graph without containing a Hamilton cycle.

• 单位
  上海交通大学