Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
From MaRDI portal
Publication:1170256
DOI10.1016/0095-8956(81)90035-6zbMath0496.05035OpenAlexW2003980189MaRDI QIDQ1170256
Ahmed Ainouche, Nicos Christofides
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)90035-6
Related Items (8)
Subgraphs, closures and hamiltonicity ⋮ Semi-independence number of a graph and the existence of Hamiltonian circuits ⋮ A note on the computation on the k-closure of a graph ⋮ A Remark on Hamiltonian Cycles ⋮ More powerful closure operations on graphs ⋮ \(\alpha\)-degree closures for graphs ⋮ \(\beta \)-degree closures for graphs ⋮ A note on \(K_ 4\)-closures in hamiltonian graph theory
Cites Work
This page was built for publication: Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
