Pages that link to "Item:Q3174240"
From MaRDI portal
The following pages link to On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240):
Displaying 4 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)
- Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
