1 problem

Let $G$ be a graph with tree-length $tl(G)$, and let $(T_i,\phi_i)$, $H_i$, $S_i$, $B_k(x_i)$, and property $P_i$ be as in the $(k,\ell)$-Disk Tree algorithm. Suppose that…