Pages that link to "Item:Q400504"
From MaRDI portal
The following pages link to A characterization of line graphs that are squares of graphs (Q400504):
Displaying 8 items.
- Squares of low clique number (Q510991) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← 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)