Pages that link to "Item:Q2446337"
From MaRDI portal
The following pages link to Computing square roots of trivially perfect and threshold graphs (Q2446337):
Displaying 15 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- A unified approach to recognize squares of split graphs (Q313959) (← links)
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- 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)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← 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)
- (Q5136273) (← 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)
