Aichholzer, O. et al. 2026. Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles. Journal of Graph Algorithms and Applications. 29, 3 (Jun. 2026), 79–109. DOI:https://doi.org/10.7155/jgaa.v29i3.3004.