Showing 2026Show all
2 papers · 1 filter
math.CO2026
The realization graph of every degree sequence has a Hamilton path
Petr Hladík, Jiří Fink
For a degree sequence , the realization graph is the graph whose vertices are the labeled realizations of , two of which are adjacent if they differ by a s…
cs.DS2026
Faster and simpler traversal of 0/1-polytopes
Jiří Fink, Petr Hladík, Arturo Merino +2
Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope , where …