Searching for \(f\)-Hamiltonian circuits

DOI10.1007/BF01204727zbMath0749.68058OpenAlexW167423317MaRDI 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-completenesspolynomial solvability\(f\)-Hamiltonian circuits\(f\)-Hamiltonian path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item

This page was built for publication: Searching for \(f\)-Hamiltonian circuits