RAMACHANDRAN S.; MONIKANDAN S. All digraphs are n-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible. Utilitas Mathematica , [S. l.], v. 71, 2006. Disponível em: https://utilitasmathematica.com/index.php/Index/article/view/395. Acesso em: 9 jul. 2026.