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