Dirac's type sufficient conditions for hamiltonicity and pancyclicity

DOI10.1007/S00373-008-0835-3zbMath1232.05119OpenAlexW2024243789MaRDI QIDQ1043808

Ahmed Ainouche

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0835-3

zbMATH Keywords

Hamiltonian graphspancyclicitypancyclic graphshamiltonicitydual closureconditionsDirac type

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Toughness, Hamiltonicity and spectral radius in graphs ⋮ Recent advances on the Hamiltonian problem: survey III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\beta \)-degree closures for graphs
• A cycle structure theorem for Hamiltonian graphs
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• A method in graph theory
• Pancyclic graphs. I
• A note on a new condition implying pancyclism
• Note on Hamilton Circuits
• New sufficient conditions for hamiltonian and pancyclic graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Dirac's type sufficient conditions for hamiltonicity and pancyclicity