Comparison of sufficient degree based conditions for Hamiltonian graph

DOI10.17223/20710410/45/6MaRDI QIDQ5151276zbMATH OpenOpenAlexFDO

Authors M. B. Abrosimov

Publication date 17 February 2021

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm671

zbMATH Keywords

Chvatal's theoremDirac's theoremHamiltonian graphOre's theoremPosa's theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
• On the necessity of Chvátal's Hamiltonian degree condition
• A sufficient condition for Hamilton graphs
• Hamilton cycles and degree sequences
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees

Cites work

• A first derivative Potts model for segmentation and denoising using ILP
• A method in graph theory
• Advances on the Hamiltonian problem -- a survey
• Arc coverings of graphs
• FHCP challenge set: the first set of structurally difficult instances of the Hamiltonian cycle problem
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• scientific article; zbMATH DE number 46669 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3432285 (Why is no real title available?)
• scientific article; zbMATH DE number 6737879 (Why is no real title available?)
• scientific article; zbMATH DE number 3215865 (Why is no real title available?)
• nauty
• Note on Hamilton Circuits
• On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
• On Hamilton's ideals
• Practical graph isomorphism. II.
• Some Theorems on Abstract Graphs
• Updating the hamiltonian problem—A survey

Cited in

(3)

• On the necessity of Chvátal's Hamiltonian degree condition
• Constructing all nonisomorphic supergraphs with isomorphism rejection
• FHCP challenge set: the first set of structurally difficult instances of the Hamiltonian cycle problem

Describes a project that uses

Uses Software

• nauty
• TSPLIB
• Traces
• OEIS

This page was built for publication: Comparison of sufficient degree based conditions for Hamiltonian graph

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