Recommendations
Cited in
(10)- The \((\leq 6)\)-half-reconstructibility of digraphs
- ( k)-half-reconstructible tournaments for k 6
- \((\leq k)\)-hereditarily reconstructible digraphs
- scientific article; zbMATH DE number 458873 (Why is no real title available?)
- The half-isomorphy and the finite strongly connected tournaments
- Characterization of the ( 3)-hypomorphy classes with the aid of interdictions
- The minimal non-( k)-reconstructible relations
- scientific article; zbMATH DE number 417290 (Why is no real title available?)
- Half-isomorphy, selfduality and finite non strongly connected tournaments
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation
This page was built for publication: La relation différence et l'anti‐isomorphie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835530)