scientific article; zbMATH DE number 3334164
From MaRDI portal
zbMath0211.01802MaRDI QIDQ5611770
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The idiosyncratic polynomial of digraphs, Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\), The \((\leq 6)\)-half-reconstructibility of digraphs, Totally symmetric functions are reconstructible from identification minors, Prechains and self duality, The pairs of \(\{-3\}\)-hypomorphic tournaments, \((\leq k)\)-reconstructible binary relations, Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs), Better quasi-orders for uncountable cardinals, The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\), \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\), Finite orders which are reconstructible up to duality by their comparability graphs, The half-isomorphy and the finite strongly connected tournaments, Unnamed Item, The minimal non-\((\leqslant k)\)-reconstructible relations, What is reconstruction for ordered sets?, Rélations non reconstructibles par leurs restrictions, Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments, Condition de chaîne en théorie des rélations, Graphs critically without duo, Sur les premeilleurs ordres. (On prémeilleurs orderings), Reconstruction of posets with the same comparability graph, Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic, Half-reconstruction of the operator transitive closure, Faithful extensions on finite orders classes, Set-reconstructibility of Post classes, La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
