Sur la (-k)-demi-reconstructibilité des tournois finis

DOI10.1016/S0764-4442(98)80010-4zbMath0915.05091MaRDI QIDQ4218652

Jamel Dammak, Youssef Boudabbous

Publication date: 22 June 1999

Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

zbMATH Keywords

tournamentreconstructionisomorphic

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ The half-isomorphy and the finite strongly connected tournaments ⋮ Half-isomorphy, selfduality and finite non strongly connected tournaments ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

This page was built for publication: Sur la (-k)-demi-reconstructibilité des tournois finis