Discrete Splittings of the Necklace

References

• Alon N. Splitting necklaces. Adv. Math. (1987) 63:247–253Crossref, Google Scholar
• Alon N. Non-constructive proofs in combinatorics. Proc. Internat. Congr. Math., Kyoto, Japan, 1990 (1991) (Springer Verlag, Tokyo) 1421–14291991Google Scholar
• Alon N., West D. The Borsuk-Ulam theorem and bisection of necklaces. Proc. Amer. Math. Soc. (1986) 98:623–628Crossref, Google Scholar
• Alon N., Moshkovitz D., Safra S. Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms (2006) 2:153–177Crossref, Google Scholar
• Bonsma P. S., Epping T., Hochstättler W. Complexity results on restricted instances of a paint shop problem for words. Discrete Appl. Math. (2006) 154:1335–1343Crossref, Google Scholar
• Ehrenborg R., Hetyei G. Generalizations of Baxter's theorem and cubical homology. J. Combin. Theory Ser. A (1995) 69:233–287Crossref, Google Scholar
• Epping T., Hochstättler W., Oertel P. Complexity results on a paint shop problem. Discrete Appl. Math. (2004) 136:217–226Crossref, Google Scholar
• Fan K. Combinatorial properties of certain simplicial and cubical vertex maps. Arch. Math. (1960) 11:368–377Crossref, Google Scholar
• Goldberg C. H., West D. Bisection of circle colorings. SIAM J. Algebraic Discrete Methods (1985) 6:93–106Crossref, Google Scholar
• Matoušek J.Using the Borsuk-Ulam Theorem (2003) (Springer Verlag, Berlin) Google Scholar
• Meunier F., Sebö A. Paint shop, odd cycles and splitting necklace. Discrete Appl. Math. (Forthcoming) Google Scholar
• Papadimitriou C. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. (1994) 48:498–532Crossref, Google Scholar
• Prescott T., Su F. A constructive proof of Ky Fan's generalization of Tucker's lemma. J. Combin Theory Ser. A (2005) 111:257–265Crossref, Google Scholar
• Simmons F. W., Su F. Consensus-halving via theorems of Borsuk-Ulam and Tucker. Math. Soc. Sci. (2003) 45:15–25Crossref, Google Scholar
• Ziegler G. Generalized Kneser coloring theorems with combinatorial proofs. Invent. Math. (2002) 147:671–691Crossref, Google Scholar