Pages that link to "Item:Q2442205"
From MaRDI portal
The following pages link to Square roots of minor closed graph classes (Q2442205):
Displaying 15 items.
- Squares of low clique number (Q510991) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← 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)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- Square roots of minor closed graph classes (Q2857427) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← 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)
