scientific article; zbMATH DE number 3375499
From MaRDI portal
Publication:5646907
Cited in
(14)- Prechains and self duality
- The \((\leq 6)\)-half-reconstructibility of digraphs
- \((\leq k)\)-reconstructible binary relations
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
- The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
- ( k)-half-reconstructible tournaments for k 6
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- Morphology of the connected components of the Boolean sum of two digraphs \((\le 5)\)-hypomorphic up to complementation
- \((\leq k)\)-hereditarily reconstructible digraphs
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- The pairs of \(\{-3\}\)-hypomorphic tournaments
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5646907)
