Pages that link to "Item:Q2524984"
From MaRDI portal
The following pages link to On the problem of reconstructing a tournament from subtournaments (Q2524984):
Displayed 13 items.
- The half-isomorphy and the finite strongly connected tournaments (Q698691) (← links)
- A census of non-reconstructable digraphs. I: Six related families (Q1135862) (← links)
- Strongly self-complementary and hereditarily isomorphic tournaments (Q1229221) (← links)
- On reconstructing graphs from their sets of subgraphs (Q1229231) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- Vertex ordering and partitioning problems for random spatial graphs. (Q1884828) (← links)
- A larger class of reconstructible tournaments (Q1917492) (← links)
- Are all pairs of hypomorphic digraphs \(S\)-isomorphic? (Q2161275) (← links)
- Reconstruction of maximal outerplanar graphs (Q2552507) (← links)
- Reconstructing the degree pair sequence of a digraph (Q2555081) (← links)
- Determining connectedness from subdigraphs (Q2562869) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)