1990 | OriginalPaper | Chapter
One-Factorizations of Tensor Products of Graphs
Authors : B. Alspach, J. C. George
Published in: Topics in Combinatorics and Graph Theory
Publisher: Physica-Verlag HD
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A very natural question raised about products of graphs is the following. Do there exist necessary and sufficient conditions on a pair (G,H) of graphs for their product to have some specified property? In particular, for which graphs is the product one-factorizable? Sufficient conditions have been investigated for the cartesian, lexicographic, and tensor products in [3], [4], and [5]. However, the conditions for the tensor product to be one-factorizable are significantly more scanty than those for the other products. The purpose of this paper is to correct this situation somewhat.