On one extension of Dirac's theorem on Hamiltonicity

DOI10.1016/j.dam.2017.01.011zbMath1401.05172arXiv1606.03687OpenAlexW2586509674MaRDI QIDQ1630770

Mordechai Shalom, Sibel Özkan, Yasemin Büyükçolak, Didem Gözüpek

Publication date: 10 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.03687

zbMATH Keywords

cyclepathHamiltonian graphgraph algorithmsminimum degreeDirac's theoremsufficiency conditionself-contained constructive proof

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Non-Hamiltonian graphs with large minimum degree

Cites Work

• Unnamed Item
• A new sufficient condition for hamiltonicity of graphs
• An improved degree based condition for Hamiltonian cycles
• Recognizing tough graphs is NP-hard
• A simple proof of a theorem of Jung
• On Hamiltonian cycles and Hamiltonian paths
• A method in graph theory
• Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
• An efficient condition for a graph to be Hamiltonian
• Note on Hamilton Circuits
• On Maximal Circuits in Finite Graphs
• On the Structure of Non-Hamiltonian Graphs I
• Reducibility among Combinatorial Problems
• On Hamiltonian Circuits in Finite Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: On one extension of Dirac's theorem on Hamiltonicity