The complexity of finding a second Hamiltonian cycle in cubic graphs
From MaRDI portal
Recommendations
- The complexity of Thomason's algorithm for finding a second Hamiltonian cycle
- Simple algorithm for finding a second Hamilton cycle
- Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3780579 (Why is no real title available?)
- scientific article; zbMATH DE number 125484 (Why is no real title available?)
- scientific article; zbMATH DE number 1263206 (Why is no real title available?)
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- On existence theorems
- On the complexity of the parity argument and other inefficient proofs of existence
Cited in
(11)- A parity theorem about trees with specified degrees
- A short note on graphs with long Thomason chains
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
- Simple algorithm for finding a second Hamilton cycle
- Long cycles in Hamiltonian graphs
- scientific article; zbMATH DE number 7559398 (Why is no real title available?)
- The complexity of Thomason's algorithm for finding a second Hamiltonian cycle
- Understanding PPA-completeness
- A PPA parity theorem about trees in a bipartite graph
- The complexity of iterated reversible computation
This page was built for publication: The complexity of finding a second Hamiltonian cycle in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1307702)
