The following pages link to (Q5646907):
Displaying 13 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- The \((\leq 6)\)-half-reconstructibility of digraphs (Q404400) (← links)
- Prechains and self duality (Q418880) (← links)
- The pairs of \(\{-3\}\)-hypomorphic tournaments (Q432667) (← links)
- The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\) (Q935344) (← links)
- \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) (Q950116) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) (Q1864566) (← links)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments (Q2271991) (← links)
- \((\leq k)\)-reconstructible binary relations (Q2434745) (← links)
- (Q5078313) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
