RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
From MaRDI portal
Publication:4295208
Recommendations
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- scientific article; zbMATH DE number 4075060
- scientific article; zbMATH DE number 4075061
- scientific article; zbMATH DE number 50583
Cited in
(34)- La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations)
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament).
- Reconstruction of posets with the same comparability graph
- The minimal non-( k)-reconstructible relations
- What is reconstruction for ordered sets?
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- Indecomposability graph and indecomposability recognition
- \((\leq k)\)-reconstructible binary relations
- Finite tournaments with a nonempty diamonds' support
- scientific article; zbMATH DE number 417290 (Why is no real title available?)
- scientific article; zbMATH DE number 458873 (Why is no real title available?)
- RECONSTRUCTION D'UNES-EXPANSION
- scientific article; zbMATH DE number 4075060 (Why is no real title available?)
- scientific article; zbMATH DE number 4075061 (Why is no real title available?)
- On a Reconstruction of Models with Only One Binary Relation
- \(\{-1\}\)-self dual finite prechains and applications
- scientific article; zbMATH DE number 50583 (Why is no real title available?)
- The \((\leq 6)\)-half-reconstructibility of digraphs
- Prechains and self duality
- La dualité dans la demi-reconstruction des relations binaires finies
- Subtournaments isomorphic to W₅ in a indecomposable tournament
- Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- Procédé de construction des relations binaires non (≤ 3)-reconstructibles
- Description of the orders which are hereditarily half-reconstructible by their comparability graphs
- \((\leq k)\)-hereditarily reconstructible digraphs
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
- F3-Reconstruction and Bi-Founded 2-Structures
- Morphology of the connected components of the Boolean sum of two digraphs ( 5)-hypomorphic up to complementation
- Characterisation of \(d\)-demi-reconstructible finite binary relations
- The \((-5)\)-demi-reconstructibility of finite related binary relations
- The threshold for top-down reconstructibility modulo the duality of finite binary relations
- The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
This page was built for publication: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4295208)