Ramachandran S., and Monikandan S. 2006. “All Digraphs Are N-Reconstructible If All Digraphs With 2-Connected Underlying Graphs Are N-Reconstructible”. Utilitas Mathematica 71 (September). https://utilitasmathematica.com/index.php/Index/article/view/395.