The reasoning is analogous, but in this case max(i, j) is the node that gets removed from the set Π when the arc (k, l) is added, making it impossible to add the arc (i, j) afterwards.
divisible systems can only generate planar dependency graphs.