A degree condition implying that every matching is contained in a hamiltonian cycle

作者：Amar Denise; Flandrin Evelyne; Gancarzewicz Grzegorz^*

来源：Discrete Mathematics, 2009, 309(11): 3703-3713.

DOI：10.1016/j.disc.2008.02.003

• Cycle
• Hamiltonian cycle
• Matching

We give a degree sum condition for three independent vertices tinder which every matching of a graph lies in a hamiltonian cycle. We also show that the bound for the degree SLIM is almost the best possible.

• 出版日期2009-6-6