A dissection of a plane geometrical figure is a partition of it by straight lines.
Thus, the solution is a partition of a given graph into as many IDSC as there are sinks.
A large set of disjoint STS v) (briefly LSTS v)) is a partition of all 3-subsets (triples) of X into v−2 STS v).
An overlarge set of idempotent quasigroups of order n is a partition of T(n + 1) into n + 1 n(n – 1) × 3 partial orthogonal arrays Ax, x ɛ X based on X \ {x}.
A separated graph is a pair (E,C) consisting of a directed graph E and a set C="⨆v∈E0Cv, where each Cv is a partition of the set of edges whose terminal vertex is v.
An orthogonally resolvable matching design OMD n,k) is a partition of the edges of the complete graph Kn into matchings of size k, called blocks, such that the blocks can be resolved in two different ways.
An augmented Steiner quadruple system (X,B,E) of order v is resolvable if B∪E can be partitioned into n="(v−1)(v+4)/6 parts B∪E="P1|P2|⋯|Pn such that each part Pi is a partition of X.
Then a G-decomposition of Kv, a complete graph on v vertices, is a pair Σ="(X,B), where X is the vertex set of Kv and B is a partition of the edge set of Kv into graphs all isomorphic to G. The elements of B are called blocks and Σ is said to be a G-design of order v.
A large set of t- v,k,λ) designs of size N, denot- v,k LS[N](t,λ,v), is a partition of all k-subsets of a v-set into N designst t-(v,k,λ) designs, where N=(v−tk−t)/λ.
