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 [Internet]. 2006 Sep. 9 [cited 2026 Jul. 9];71. Available from: https://utilitasmathematica.com/index.php/Index/article/view/395