1 paper
Naonori Kakimura, Yuta Mishima
This paper introduces a new reconfiguration problem of matchings in a triangular grid graph. In this problem, we are given a nearly perfect matching in which each matching edge is…