Matching edges and faces in polygonal partitions (Q2462737): Difference between revisions

The paper establishes sufficient criteria for the existence of perfect matchings between the edge sets or the face sets of two polygonal partitions in the plane with common vertex set. The criteria are expressed in terms of equalities and inequalities (Laman-type conditions) for certain parameters associated with the subsets of the underlying vertex set. Several well-known classes, including \(k\)-regular partitions, \(k\)-angulations, and rank-\(k\) pseudo-triangulations, are shown to satisfy the criteria. Decomposability problems for edge graphs of polygonal partitions into edge-disjoint spanning trees are also studied.