Recommendations
Cites work
- A generalization of a result of Häggkvist and Nicoghossian
- A remark on Hamiltonian cycles
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
- scientific article; zbMATH DE number 4093495 (Why is no real title available?)
- scientific article; zbMATH DE number 57115 (Why is no real title available?)
- On Maximal Circuits in Finite Graphs
- Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
- Tough graphs and Hamiltonian circuits.
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
Cited in
(10)- Counterexample to a conjecture on Hamilton cycles
- Toughness and edge-toughness
- A sufficient condition for Hamiltonian cycles in tough graphs
- Hamilton cycles in 1-tough triangle-free graphs
- Toughness in graphs -- a survey
- scientific article; zbMATH DE number 19172 (Why is no real title available?)
- scientific article; zbMATH DE number 54811 (Why is no real title available?)
- scientific article; zbMATH DE number 1792643 (Why is no real title available?)
- A remark on trace properties of K-cycles
- Hamiltonian Cycles on Archimedean Solids Are Twisting Free
This page was built for publication: A Remark on Hamiltonian Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024478)