Pages that link to "Item:Q2519016"
From MaRDI portal
The following pages link to Hypomorphy of graphs up to complementation (Q2519016):
Displaying 8 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)
- \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets (Q1741582) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- Equality of graphs up to complementation (Q2023760) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
- Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)
- Morphology of the connected components of the Boolean sum of two digraphs \((\le 5)\)-hypomorphic up to complementation (Q6629785) (← links)
