Sur la (-k)-demi-reconstructibilité des tournois finis
From MaRDI portal
Publication:4218652
Recommendations
Cited in
(20)- scientific article; zbMATH DE number 817353 (Why is no real title available?)
- LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
- The \((\leq 6)\)-half-reconstructibility of digraphs
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
- scientific article; zbMATH DE number 4039950 (Why is no real title available?)
- ( k)-half-reconstructible tournaments for k 6
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- On Stockmeyer's non-reconstructible tournaments
- The (-1)-critical tournaments
- scientific article; zbMATH DE number 4168706 (Why is no real title available?)
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- The pairs of \(\{-3\}\)-hypomorphic tournaments
- A short proof of a theorem of Reid and Parker on tournaments
- The \((-5)\)-demi-reconstructibility of finite related binary relations
- The threshold for top-down reconstructibility modulo the duality of finite binary relations
- The half-isomorphy and the finite strongly connected tournaments
- The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
- The \((-1)\)-critically duo-free tournaments.
- Half-isomorphy, selfduality and finite non strongly connected tournaments
- Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
This page was built for publication: Sur la (-k)-demi-reconstructibilité des tournois finis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218652)