ScholarMate
客服热线:400-1616-289

A note on the 2-power of Hamilton cycles

Khan, Zia Ullah; Yuan, Long-Tu*
Science Citation Index Expanded
上海交通大学

摘要

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.

关键词

2-power of graphs Hamilton cycle