For a discrete model with tree-like structure, we demonstrate that if a separating variable (a root vertex) is binary, then constraints (like “tetrad difference”) hold. Specifically, when there are four or three manifest ...

The article considers theorems which are useful for the mathematical and computer modeling of the covering problems of a compact canonical multiconnected polygonal set with a finite family of convex polygons. Based on ...