Figure 3:
Example of node-label-constraints for sets of two nodes (
3.23
) dominating Inequalities (
3.22
), that is, the node-label constraints for single nodes. For both nodes
𝑣
𝑖
,
𝑖
=
1
,
2
it holds that
∑
𝑙
∈
𝐿
(
𝑣
𝑖
)
𝑙
≥
1
. Corresponding Inequality (
3.23
) is however violated, as
∑
𝑙
∈
𝐿
(
𝑣
1
)
∪
𝐿
(
𝑣
2
)
𝑙
=
3
/
2
.
