Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path

DOI10.1007/978-3-319-51963-0_16MaRDI QIDQ2971135zbMATH OpenOpenAlexFDO

Authors Benjamin Momège

Publication date 4 April 2017

Published in SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-51963-0_16

zbMATH Keywords

combinatorial problemsconnected graphsdegreeHamiltonian path

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 68033
• scientific article; zbMATH DE number 4043882
• scientific article; zbMATH DE number 205869
• scientific article; zbMATH DE number 4134087
• scientific article; zbMATH DE number 811601
• Sufficient conditions for a graph to be Hamilton-connected and traceable from every vertex
• Necessary and sufficient conditions for a Hamiltonian graph
• A sufficient condition for s-Hamilton-connected graphs
• scientific article; zbMATH DE number 147627
• scientific article; zbMATH DE number 1159754

Cites work

• A method in graph theory
• Advances on the Hamiltonian problem -- a survey
• Claw-free graphs---a survey
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Hamilton cycles in claw-free graphs
• Hamiltonicity for K_{1, r}‐free graphs
• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• scientific article; zbMATH DE number 3733966 (Why is no real title available?)
• scientific article; zbMATH DE number 637321 (Why is no real title available?)
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• Note on Hamilton Circuits
• Recent advances on the Hamiltonian problem: survey III
• Relative length of long paths and cycles in graphs with large degree sums
• Some Theorems on Abstract Graphs
• Updating the hamiltonian problem—A survey

Cited in

(6)

• Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
• A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
• scientific article; zbMATH DE number 4021183 (Why is no real title available?)
• Various length paths in graphs
• 2-Trees: Structural insights and the study of Hamiltonian paths
• A _3 condition for arbitrarily partitionable graphs

This page was built for publication: Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path

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