The following pages link to The square root of a graph (Q5534027):
Displaying 19 items.
- Parameterized algorithms for finding square roots (Q262249) (← 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)
- Applications of edge coverings by cliques (Q762498) (← links)
- The square of a block graph (Q965949) (← links)
- A characterization of competition graphs (Q1055443) (← links)
- The square of a chordal graph (Q1322181) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- A good characterization of squares of strongly chordal split graphs (Q1944051) (← 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)
- Characterization of n-path graphs and of graphs having \(n\)-th root (Q2562796) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- On balance and consistency preserving 2-path signed graphs (Q6090315) (← links)
