Heuristic search for Hamilton cycles in cubic graphs
From MaRDI portal
Publication:864114
DOI10.1016/j.disc.2005.09.052zbMath1110.05056OpenAlexW2083695425MaRDI QIDQ864114
Janez Aleš, Bojan Mohar, Tomaž Pisanski
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.052
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Hamiltonian cycles in vertex symmetric graphs of order \(2p^ 2\)
- A domain monotonicity theorem for graphs and Hamiltonicity
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Heuristic search for Hamilton cycles in cubic graphs