Skip to main content
Log in

Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We continue the study of small cycle double covers of products of graphs that began in [7], concentrating here on the categorical product and the strong product. Under the assumption that G has an SCDC, we show that G × P m has an SCDC for all m ≠ 3, and that G × C m has an SCDC for all m ≥ 3. For the strong product we use results about the categorical product and the Cartesian product [7] to show that if G has an SCDC, then so does GC m , m ≥ 5. Some results are also given for GP m , but require additional assumptions about the SCDC of G.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy, J.A.: Small cycle double covers of graphs, in Cycles and Rays (G. Hahn, G. Sabidussi, and R. Woodrow, eds.), NATO ASI ser. C, Kluwer Academic Publishers, Dordrecht, 1990, pp. 21–40

  2. Bondy, J.A.: Perfect path double covers of graphs. J. Graph Theory 14, 259–272 (1990)

    Google Scholar 

  3. Fish, J.M., Klimmek, R., Seyffarth, K.: Line graphs of complete multipartite graphs have small cycle double covers. Discrete Mathematics 257, 39–62 (2002)

    Google Scholar 

  4. Klimmek, R.: Small cycle decompositions and small cycle double covers of graphs. Ph.D. Thesis, Freien Universität Berlin, 1997

  5. Li, H.: Perfect path double covers in every simple graph. J. Graph Theory 14, 645–650 (1990)

    Google Scholar 

  6. MacGillivray, G., Seyffarth, K.: Classes of line graphs with small cycle double covers. Australasian Journal of Combinatorics 24, 91–114 (2001)

    Google Scholar 

  7. Nowakowski, R.J., Seyffarth, K.: Small cycle double covers of products I: lexicographic product with paths and cycles. J. Graph Theory 57, 99–123 (2008)

    Google Scholar 

  8. Seyffarth, K.: Small cycle double covers of 4–connected planar graphs. Combinatorica 13, 477–482 (1993)

    Google Scholar 

  9. Seymour, P.D.: Sums of circuits, in Graph Theory and Related Topics (J.A. Bondy and U.S.R. Murty, eds.), Academic Press, New York, 1979, pp. 341–355

  10. Szekeres, G.: Polyhedral decomposition of cubic graphs. Bull. Austral. Math. Soc. 8, 367–387 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The authors gratefully acknowledge the support of the Natural Sciences and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nowakowski, R.J., Seyffarth, K. Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles. Graphs and Combinatorics 25, 385–400 (2009). https://doi.org/10.1007/s00373-009-0844-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-009-0844-x

Keywords

Navigation