Applicable Analysis and Discrete Mathematics

Abstract

for 15 ≤ k ≤ 18. Instead of directly running any heuristics, we use existing results on the middle levels problem, therefore further relating these two fundamental problems, namely finding a Hamiltonian path in the odd graph and finding a Hamiltonian cycle in the corresponding middle levels graph. We show that further improved results for the middle levels… (More)

Topics

4 Figures and Tables

Slides referencing similar topics