Tight factorizations of girth-$g$-regular graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917009281777664 |
|---|---|
| author | Dejter, Italo J. |
| author_facet | Dejter, Italo J. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2102_06956 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Tight factorizations of girth-$g$-regular graphs Dejter, Italo J. Combinatorics 05C15, 05C38 05C70, 05C90 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. |
| title | Tight factorizations of girth-$g$-regular graphs |
| topic | Combinatorics 05C15, 05C38 05C70, 05C90 |
| url | https://arxiv.org/abs/2102.06956 |