Graphs with exactly one hamiltonian circuit

DOI10.1002/jgt.3190010110zbMath0359.05026OpenAlexW1994661668MaRDI QIDQ4132556

John 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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs, On common edges in optimal solutions to traveling salesman and other optimization problems, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, On unique \(k\)-factors and unique \([1,k\)-factors in graphs.], On the structure of graphs with a uniquek-factor, Graphs with few hamiltonian cycles, Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem, Finding Hamiltonian Cycle in Graphs of Bounded Treewidth, Maximum graphs with a unique k-factor, Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles