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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.06.003 |