Upper bounds for the necklace folding problems

DOI10.1016/j.jctb.2022.05.012OpenAlexW3032003206MaRDI QIDQ2171014

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

Publication date: 23 September 2022

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

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

zbMATH Keywords

counterexampleconstructioncrossing-free matchingseparated matching

Mathematics Subject Classification ID

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

Cites Work

• Long alternating paths in bicolored point sets
• Palindromic subsequences in finite words
• Separated Matchings and Small Discrepancy Colorings
• Graph Drawing
• Long Alternating Paths Exist

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