Pages that link to "Item:Q551233"
From MaRDI portal
The following pages link to Uniqueness of graph square roots of girth six (Q551233):
Displaying 9 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- On the maximum number of independent elements in configurations of points and lines (Q464738) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Edge ideals of squares of trees (Q2134245) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
