Necklace bisection with one cut less than needed
From MaRDI portal
Publication:1010671
zbMath1163.05310MaRDI QIDQ1010671
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129977
Partitions of sets (05A18) Fixed points and coincidences in algebraic topology (55M20) Extremal combinatorics (05D99)
Related Items (3)
A survey of mass partitions ⋮ Computing solutions of the paintshop-necklace problem ⋮ Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
This page was built for publication: Necklace bisection with one cut less than needed
