Searching for \(f\)-Hamiltonian circuits

DOI10.1007/BF01204727zbMath0749.68058MaRDI QIDQ1196437

Gyula Y. Katona

Publication date: 14 December 1992

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01204727

zbMATH Keywords

NP-completeness; polynomial solvability; \(f\)-Hamiltonian circuits; \(f\)-Hamiltonian path

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Cites Work

• Unnamed Item