Factoring the product of a cubic graph and a triangle
| dc.contributor.author | Horton, J., D. | |
| dc.date.accessioned | 2023-03-01T18:26:58Z | |
| dc.date.available | 2023-03-01T18:26:58Z | |
| dc.date.issued | 1989 | |
| dc.description.abstract | Kotzig [J. Graph Theory 3 (1979) pp 23-34] proved that for any cubic graph G and any circuit of length n, C , n>3, the (Cartesian) product GxC has a 1-factorization, and that if G contains a bridge, GxC3 does not. In this paper it is shown that if G is a 2-connected cubic graph, then GxC3 decomposes into two hamilton circuits and a 1-factor. | |
| dc.description.copyright | Copyright @ J. D. Horton, 1989. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14667 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Factoring the product of a cubic graph and a triangle | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1