Pages that link to "Item:Q2413970"
From MaRDI portal
The following pages link to Computing square roots of graphs with low maximum degree (Q2413970):
Displaying 4 items.
- Finding cactus roots in polynomial time (Q726100) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
