Author:
Briański Marcin,Szady Adam
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs;Cameron;Discrete Math.,2001
2. Parameterized Algorithms;Cygan,2015
3. Analytic Combinatorics;Flajolet,2009
4. The complexity of finding a second Hamiltonian cycle in cubic graphs;Krawczyk;J. Comput. Syst. Sci.,1999
5. Hamiltonian cycles and uniquely edge colourable graphs;Thomason,1978