Degree conditions for Hamiltonicity: counting the number of missing edges

DOI10.1016/J.DISC.2005.11.037zbMATH Open1122.05055OpenAlexW1996647345MaRDI QIDQ868355FDOQ868355

Authors: R. H. Schelp, Akira Saito, Ingo Schiermeyer, Ralph Faudree 

Publication date: 2 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.037

Recommendations

• scientific article; zbMATH DE number 811601
• Closures, cycles, and paths
• One sufficient condition for Hamiltonian graphs involving distances
• New Ore's type results on hamiltonicity and existence of paths of given length in graphs
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem

zbMATH Keywords

Hamiltonian graphdegree condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs
• A note on Hamiltonian circuits
• New sufficient conditions for cycles in graphs
• A method in graph theory
• Title not available (Why is that?)
• Some recent results in hamiltonian graphs
• A remark on two sufficient conditions for Hamilton cycles
• Decomposition of Finite Graphs into Open Chains
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Closures, cycles, and paths
• Generalized degree conditions for graphs with bounded independence number
• A study on thek-ordered hamiltonian graphs
• Cycles with a chord in dense graphs
• New Ore's type results on hamiltonicity and existence of paths of given length in graphs

This page was built for publication: Degree conditions for Hamiltonicity: counting the number of missing edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868355)