A remark on Hamiltonian cycles

DOI10.1016/0095-8956(81)90102-7zbMath0462.05046OpenAlexW2063473349MaRDI QIDQ1153165

G. G. Nicoghossian, Roland Haeggkvist

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90102-7

zbMATH Keywords

Hamiltonian circuits

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

A generalization of a result of Häggkvist and Nicoghossian ⋮ Some local-global phenomena in locally finite graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Properties of minimally \(t\)-tough graphs ⋮ A Remark on Hamiltonian Cycles ⋮ Neighborhood unions and a generalization of Dirac's theorem ⋮ Degree sum and connectivity conditions for dominating cycles ⋮ A localization method in Hamiltonian graph theory ⋮ Graph invariants and large cycles: a survey ⋮ Toughness in graphs -- a survey ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ Dirac-type generalizations concerning large cycles in graphs ⋮ A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs ⋮ A generalization of a result of Bauer and Schmeichel

Cites Work

• Parallel concepts in graph theory
• Unnamed Item

This page was built for publication: A remark on Hamiltonian cycles