Takaya Yamada

Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem

ABSTRACT Given an undirected graph , a collection of disjoint subsets of nodes is called a pentagon partition if each subset satisfies one of the following conditions: (1) and the induced subgraph contains a simple cycle of length 5 (called pentagon ) or (2) . Let denote the set...