COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH
From MaRDI portal
Publication:5151276
DOI10.17223/20710410/45/6zbMath1459.05146OpenAlexW2987302647MaRDI QIDQ5151276
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
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- nauty
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Arc coverings of graphs
- A method in graph theory
- Advances on the Hamiltonian problem -- a survey
- Practical graph isomorphism. II.
- On Hamilton's ideals
- On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity
- Note on Hamilton Circuits
- Updating the hamiltonian problem—A survey
- A First Derivative Potts Model for Segmentation and Denoising Using ILP
- FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem
- Some Theorems on Abstract Graphs