PACH, János. Every graph admits an unambiguous bold drawing. Journal of Graph Algorithms and Applications, [S. l.], v. 19, n. 1, p. 299–312, 2015. DOI: 10.7155/jgaa.00359. Disponível em: http://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper359. Acesso em: 6 jul. 2024.