ListarMAT_Articles por tema "one-factorization"
Mostrando ítems 1-1 de 1
-
On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs
Taylor and Francis (2020-05-13)The complete graph Kn, for n even, has a one-factorization (proper edge coloring) with n – 1 colors. In the recent contribution [Dotan M., Linial N. (2017). ArXiv:1707.00477v2], the authors raised a conjecture on the ...