On one-factorizations of replacement products
On one-factorizations of replacement products
Let G be an (n, m)-graph (n vertices and m-regular) and H be an (m, d)-graph. Randomly number the edges around each vertex of G by {1,..., m} and fix it. Then the replacement product G®H of graphs G and H (with respect to the numbering) has vertex set V(G®H) …