Abstract
Various techniques have been studied which produce a new graph from two given graphs. There is some interest in the following problem: given a form of graph product, what conditions on graphs G and H imply that the product of G and H has a one-factorization? The question has been studied for cartesian products, wreath products and tensor products, among others.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wallis, W.D. (1997). Cartesian Products. In: One-Factorizations. Mathematics and Its Applications, vol 390. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2564-3_21
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2564-3_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4766-6
Online ISBN: 978-1-4757-2564-3
eBook Packages: Springer Book Archive