Finding a Maximum Restricted -Matching via Boolean Edge-CSP

Y Iwamasa, Y Kobayashi, K Takazawa - arXiv preprint arXiv:2310.20245, 2023 - arxiv.org
The problem of finding a maximum $2 $-matching without short cycles has received
significant attention due to its relevance to the Hamilton cycle problem. This problem is …