Non-Hamiltonian graphs with large minimum degree

DOI10.1007/s40840-023-01615-xzbMath1530.05105OpenAlexW4389920587MaRDI QIDQ6178660

No author found.

Publication date: 16 January 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-023-01615-x

zbMATH Keywords

stabilityminimum degreeDirac theorem

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability results on the circumference of a graph
• On maximal circuits in directed graphs
• On one extension of Dirac's theorem on Hamiltonicity
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Path Ramsey numbers in multicolorings
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• Large cycles in graphs
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Non-Hamiltonian graphs with large minimum degree