Upper bounds for the necklace folding problems

DOI10.1016/J.JCTB.2022.05.012MaRDI QIDQ2171014zbMATH OpenOpenAlexFDO

Authors Endre Csóka, Dániel Lenger, Zoltán Blázsik, Zoltán Király

Publication date 23 September 2022

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2005.12603

zbMATH Keywords

constructioncounterexamplecrossing-free matchingseparated matching

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)

Recommendations

• Bisection of Circle Colorings
• Splitting necklaces
• Computing solutions of the paintshop-necklace problem
• scientific article; zbMATH DE number 496046
• Random necklaces require fewer cuts

Cites work

• Graph Drawing
• Long Alternating Paths Exist
• Long alternating paths in bicolored point sets
• Palindromic subsequences in finite words
• Separated matchings and small discrepancy colorings

Cited in

(2)

• A Pascal-like bound for the number of necklaces with fixed density
• Upper bounds for the necklace folding problems

This page was built for publication: Upper bounds for the necklace folding problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171014)