Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
L'Indeformabilite des Relations et Multirelations Binaires - MaRDI portal

L'Indeformabilite des Relations et Multirelations Binaires

From MaRDI portal
Publication:4180356

DOI10.1002/malq.19780241905zbMath0397.04002OpenAlexW2033140251MaRDI QIDQ4180356

Gérard Lopez

Publication date: 1978

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19780241905




Related Items (23)

The \(\{-2,-1\}\)-selfdual and decomposable tournamentsThe idiosyncratic polynomial of digraphsDescription of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)Unnamed ItemPrechains and self dualityThe pairs of \(\{-3\}\)-hypomorphic tournaments\((\leq k)\)-reconstructible binary relationsSur les graphes 2-reconstructibles (On the 2-reconstructible graphs)The \((\leq 5)\)-hypomorphy of digraphs up to complementationThe \(C_{3}\)-structure of the tournaments.The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations)\((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)Finite orders which are reconstructible up to duality by their comparability graphsUnnamed ItemThe minimal non-\((\leqslant k)\)-reconstructible relationsWhat is reconstruction for ordered sets?The 2-reconstructible indecomposable graphs.Reconstruction of posets with the same comparability graphHalf-isomorphy, selfduality and finite non strongly connected tournamentsTwo {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphicHalf-reconstruction of the operator transitive closureLa 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)




This page was built for publication: L'Indeformabilite des Relations et Multirelations Binaires