TY - JOUR
AU1 - Golovach, Petr
AU2 - Kratsch, Dieter
AU3 - Paulusma, Daniël
AU4 - Stewart, Anthony
AB - A graph H is a square root of a graph G, or equivalently, G is the square of H, if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. The problem of testing whether a graph admits a square root which belongs to some specified graph class
ℋ
$\mathcal {H}$
is called the
ℋ
$\mathcal {H}$
-Square Root problem. By showing boundedness of treewidth we prove that Square Root is polynomial-time solvable on some classes of graphs with small clique number and that
ℋ
$\mathcal {H}$
-Square Root is polynomial-time solvable when
ℋ
$\mathcal {H}$
is the class of cactuses.
TI - Finding Cactus Roots in Polynomial Time
JF - Theory of Computing Systems
DO - 10.1007/s00224-017-9825-2
DA - 2017-11-21
UR - https://www.deepdyve.com/lp/springer-journals/finding-cactus-roots-in-polynomial-time-0gKSMerNDB
SP - 1409
EP - 1426
VL - 62
IS - 6
DP - DeepDyve