Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
From MaRDI portal
Publication:5937919
DOI10.1016/S0012-365X(00)00260-0zbMath0974.05050MaRDI QIDQ5937919
Publication date: 4 December 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (8)
THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE ⋮ Euler Complexes ⋮ Understanding PPA-completeness ⋮ A parity theorem about trees with specified degrees ⋮ A short note on graphs with long Thomason chains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A PPA parity theorem about trees in a bipartite graph
This page was built for publication: Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
