Upper bounds for the necklace folding problems
From MaRDI portal
Publication:6341427
DOI10.1016/j.jctb.2022.05.012arXiv2005.12603MaRDI QIDQ6341427
Dániel Lenger, Endre Csóka, Zoltán L. Blázsik, Zoltán Király
Publication date: 26 May 2020
Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)
This page was built for publication: Upper bounds for the necklace folding problems