Pages that link to "Item:Q1772265"

The following pages link to The minimal non-\((\leqslant k)\)-reconstructible relations (Q1772265):

Displaying 11 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)
• Prechains and self duality (Q418880) (← links)
• \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) (Q950116) (← links)
• The 2-reconstructible indecomposable graphs. (Q997977) (← links)
• Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
• \((\leq k)\)-reconstructible binary relations (Q2434745) (← links)
• (Q4963168) (← links)
• (Q5078313) (← links)
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
• F3-Reconstruction and Bi-Founded 2-Structures (Q6493758) (← links)