Figure 4From: Enumerating tree-like chemical graphs with given upper and lower bounds on path frequenciesDetachment-cut. Bounding operation by detachment-cut, where vectors g U (ℓ, ℓ′), g L (ℓ, ℓ′), , and are defined for unordered pairs {ℓ, ℓ′} and those with value=0 are omitted in the tables.Back to article page