Factorizations of the product of cycles
An -factorization of a graph is a partition of the edge set of into spanning subgraphs (or factors) each of whose components are isomorphic to a graph Let be the Cartesian product of the cycles with for each El-Zanati and Eynden proved that has a -factorization, where is a cycle of length if and onl...
Wedi'i Gadw mewn:
| Prif Awduron: | , , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Taylor & Francis Group
2019-12-01
|
| Cyfres: | AKCE International Journal of Graphs and Combinatorics |
| Pynciau: | |
| Mynediad Ar-lein: | http://dx.doi.org/10.1016/j.akcej.2018.06.003 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|