Abstract
In 1995, Galvin provided an elegant proof for the list edge coloring conjecture for bipartite graphs, utilizing the stable matching theorem of Gale an......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
