Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult

DOI10.1007/978-3-642-13562-0_29zbMath1284.68300MaRDI QIDQ3569086

Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_29

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

Boundary properties of graphs for algorithmic graph problems