The partition problem of a given graph into three independent sets of minimizing the maximum one is studied in this paper. This problem is NP-hard, even restricted to bipartite graphs. First, a simple
Publications
- Article type
- Year
- Co-author
Year
![](/assets/img/article/article-lock.png)
Tsinghua Science and Technology 2023, 28 (6): 1063-1071
Published: 28 July 2023
Downloads:34
Total 1