The following pages link to Combinatorial necklace splitting (Q2380234):
Displaying 13 items.
- Necklace bisection with one cut less than needed (Q1010671) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- Growing balanced covering sets (Q1981677) (← links)
- \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
- Dold's theorem from viewpoint of strong compatibility graphs (Q2297921) (← links)
- Fair splitting of colored paths (Q2401427) (← links)
- Simplotopal maps and necklace splitting (Q2439120) (← links)
- Discrete Splittings of the Necklace (Q3168988) (← links)
- ENUMERATING NECKLACES WITH TRANSITIONS (Q5023499) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)