F. Bonomo-Braberman, F. Oliveira, M. Sampaio Jr., and J. Szwarcfiter.
" The computational complexity of recognizing precedence proper k-thin graphs", in <em>Proceedings of the 5th Theory of Computation Meeting</em>, Cuiabá, 2020, pp. 5-8, doi: <a href="https://doi.org/10.5753/etc.2020.11076">https://doi.org/10.5753/etc.2020.11076</a>.