On finding a satisfactory partition in an undirected graph: algorithm design and results
A satisfactory partition is a partition of undirected-graph vertices such that the partition has only two nonempty parts, and every vertex has at least as many adjacent vertices in its part as it has in the other part. Generally, the problem of determining whether a given undirected graph has a sati...
| Hoofdauteur: | |
|---|---|
| Formaat: | Artikel |
| Taal: | English |
| Gepubliceerd in: |
AIMS Press
2024-09-01
|
| Reeks: | AIMS Mathematics |
| Onderwerpen: | |
| Online toegang: | https://www.aimspress.com/article/doi/10.3934/math.20241327?viewType=HTML |