Pages that link to "Item:Q4290082"
From MaRDI portal
The following pages link to Reconstructing a Graph from its Neighborhood Lists (Q4290082):
Displaying 9 items.
- Reconstructing trees from digitally convex sets (Q344865) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Neighborhood hypergraphs of digraphs and some matrix permutation problems (Q967325) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240) (← links)
- (Q4347876) (← links)
- (Q4368154) (← links)
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← links)