Ramachandran S.; Monikandan S. All Digraphs Are N-Reconstructible If All Digraphs With 2-Connected Underlying Graphs Are N-Reconstructible. A Canadian journal of applied mathematics, computer science and statistics 2006, 71.