Tight factorizations of girth-$g$-regular graphs
Combinatorics
2025-10-15 v14
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.
Keywords
Cite
@article{arxiv.2102.06956,
title = {Tight factorizations of girth-$g$-regular graphs},
author = {Italo J. Dejter},
journal= {arXiv preprint arXiv:2102.06956},
year = {2025}
}
Comments
45 pages, 20 figures, 9 tables