The following pages link to (Q4583735):
Displaying 5 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- (Q4963168) (← links)
- (Q5078313) (← links)
