Tight factorizations of girth--regular graphs
arXiv:2102.06956
Abstract
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to 3-dimensional geometry are given. Applications are suggested for priority assignment and optimization problems.
45 pages, 20 figures, 9 tables