In this paper, we use a hill-climbing algorithm to construct starter-induced and even starter-induced one-factorizations of complete graphs, and we discover ...
In this paper, a perfect one-factorization ofK36 is given, which is factor-1-rotational. 16 Citations.
People also ask
What is a perfect 1 factorization?
What is a 1 factorization of a complete graph?
In this paper, a perfect one-factorization of K36 is given, which is factor-l-rotational. We consider a 1-factorization of K2n, the complete graph with 2n ...
In this paper, we study one-factorizations with the additional property that every pair of distinct one-factors forms a. Hamiltonian cycle. Such a one- ...
A one-factorization of a complete graph K₂ is a partition of the edge-set of. K2n into 2n - 1 one-factors, each of which contains n edges that partition the.
M. Kobayashi, H. Awoki, Y. Nakazaki, and G. Nakamura, A perfect one-factorization of K36, to appear.
A one-factorization of a complete graph Krn is a partition of the eclge-set of. Krn into 2n - | one-factors, each of which contains n eclges that partition ...
A perfect 1-factorization is a 1-factorization in which every pair of distinct. 1-factors forms a Hamilton cycle. It has been conjectured that a perfect 1- ...
Gisaku Nakamura, A perfect one-factorization of K36, preprint. one-. Midori Kobayashi and Kiyasu-Zen'iti, Perfect factorizations of K1332 and K6860, J. Comb ...
Perfect one-factorization of the complete graph K2n for all n greater and equal to 2 is conjectured. Nevertheless some families of complete graphs were ...