New Ore's type results on hamiltonicity and existence of paths of given length in graphs

DOI10.1007/s00373-011-1096-0zbMath1258.05062OpenAlexW2070454056MaRDI QIDQ1938881

Nicolas Lichiardopol

Publication date: 25 February 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-011-1096-0

zbMATH Keywords

pathHamiltonian graphminimum degreeOre's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Degree conditions for Hamiltonicity: counting the number of missing edges
• On Hamilton's ideals
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs

This page was built for publication: New Ore's type results on hamiltonicity and existence of paths of given length in graphs