Using these LL- and ML-values, Heath and Pemmaraju (1996a, 1996b) describe a set of rules how to connect two PQ-trees claiming that the pertinent leaves of the new tree T ~ are reducible if and only if the corresponding component F' is leveled planar.