The following pages link to (Q5611770):
Displaying 27 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- The \((\leq 6)\)-half-reconstructibility of digraphs (Q404400) (← links)
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Prechains and self duality (Q418880) (← links)
- The pairs of \(\{-3\}\)-hypomorphic tournaments (Q432667) (← links)
- The half-isomorphy and the finite strongly connected tournaments (Q698691) (← links)
- The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\) (Q935344) (← links)
- \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) (Q950116) (← links)
- Graphs critically without duo (Q1018107) (← links)
- Better quasi-orders for uncountable cardinals (Q1171568) (← links)
- Rélations non reconstructibles par leurs restrictions (Q1223295) (← links)
- Condition de chaîne en théorie des rélations (Q1250101) (← links)
- Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs) (Q1415522) (← links)
- Reconstruction of posets with the same comparability graph (Q1569035) (← links)
- Half-reconstruction of the operator transitive closure (Q1598447) (← links)
- The minimal non-\((\leqslant k)\)-reconstructible relations (Q1772265) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) (Q1864566) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- The idiosyncratic polynomial of digraphs (Q2155544) (← links)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments (Q2271991) (← links)
- Set-reconstructibility of Post classes (Q2348047) (← links)
- \((\leq k)\)-reconstructible binary relations (Q2434745) (← links)
- Sur les premeilleurs ordres. (On ''prémeilleurs'' orderings) (Q2548260) (← links)
- Faithful extensions on finite orders classes (Q3439369) (← links)
- (Q5078313) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
