机译:An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
The authors are with the Graduate School of Information Sci-ences, Tohoku University, Sendai-shi, 980-8579 Japan;
graph algorithm; list edge-coloring; reachability on solution space; reconfiguration problem; tree;