Pages that link to "Item:Q4764347"
From MaRDI portal
The following pages link to Algorithms for Square Roots of Graphs (Q4764347):
Displaying 31 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Distance three labelings of trees (Q415278) (← 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)
- Computing roots of graphs is hard (Q1336641) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- On powers of \(m\)-trapezoid graphs (Q1902905) (← 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)
- Square roots of minor closed graph classes (Q2442205) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- OPTIMAL RADIOCOLORING OF TREES (Q5221077) (← links)
- Complexity of the Packing Coloring Problem for Trees (Q5302050) (← 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)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
