The following pages link to Computing roots of graphs is hard (Q1336641):
Displaying 34 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- A unified approach to recognize squares of split graphs (Q313959) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- Clique complexes and graph powers (Q375885) (← 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)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- The square of a block graph (Q965949) (← links)
- Exact leaf powers (Q982668) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- A good characterization of squares of strongly chordal split graphs (Q1944051) (← links)
- Biclique graphs of interval bigraphs (Q2184675) (← 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)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Strongly simplicial vertices of powers of trees (Q2455590) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- Local-Global Phenomena in Graphs (Q4290099) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← 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)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
