Graphs with exactly one hamiltonian circuit
From MaRDI portal
Publication:4132556
DOI10.1002/JGT.3190010110zbMATH Open0359.05026OpenAlexW1994661668MaRDI QIDQ4132556FDOQ4132556
Authors: J. Sheehan 
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010110
Cited In (10)
- On common edges in optimal solutions to traveling salesman and other optimization problems
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
- Graphs with few Hamiltonian cycles
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- On the structure of graphs with a uniquek-factor
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
- Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- Maximum graphs with a unique k-factor
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
This page was built for publication: Graphs with exactly one hamiltonian circuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132556)
