commit b9a00746f8419a5f2a5099726263fcbeb6d43ce5 parent 36c1dbaf4c02cb2e3e0abcaef6c36d8f22cf3554 Author: Antoine Amarilli <a3nm@a3nm.net> Date: Thu, 17 Sep 2026 19:37:55 +0200 commit with codex Diffstat:
| hamiltonian_cycle_multiple | | | 10 | ---------- |
1 file changed, 0 insertions(+), 10 deletions(-)
diff --git a/hamiltonian_cycle_multiple b/hamiltonian_cycle_multiple @@ -1,10 +0,0 @@ -# Hamiltonian cycle multiple - -A generalization of [Hamiltonian_cycle] where you can go over each [vertex] at most k times for some k. -- By https://courses.engr.illinois.edu/cs374/fa2016/homework/hw10.pdf this problem is also [NP_complete]. -- A [star] with large [degree] is an example of a [graph] having no such generalized [hamiltonian_path] for any k -- mentioned here https://cstheory.stackexchange.com/questions/53492/name-for-a-cyclic-path-in-a-graph-that-visits-every-vertex-while-minimizing-the - -Up: [hamiltonian_cycle] - -See also: [hamiltonian_path_multiple]