The following pages link to Bipartite roots of graphs (Q2944512):
Displaying 24 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)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- The square of a block graph (Q965949) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← 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)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- On the square coloring of comparability graphs (Q5083861) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q5136273) (← links)
- (Q5501358) (← links)
- (Q5854611) (← 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)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
