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.
Zircon - This is a contributing Drupal Theme Design by WeebPal.
