Ramachandran S., & Monikandan S. (2006). All digraphs are n-reconstructible if all digraphs with 2-connected underlying graphs are N-reconstructible. Utilitas Mathematica, 71. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/395