The University of Southampton
University of Southampton Institutional Repository

1-factorisation of the Composition of Regular Graphs

Pisanski, T., Shawe-Taylor, J. and Mohar, B. (1983) 1-factorisation of the Composition of Regular Graphs Publications de l'Institut Mathématique, 33, (47), pp. 193-196.

Record type: Article


1-factorability of the composition of graphs is studied. The followings sufficient conditions are proved: $G[H]$ is 1-factorable if $G$ and $H$ are regular and at least one of the following holds: (i) Graphs $G$ and $H$ both contain a 1-factor, (ii) $G$ is 1-factorable (iii) $H$ is 1-factorable. It is also shown that the tensor product $G\otimes H$ is 1-factorable, if at least one of two graphs is 1-factorable. This result in turn implies that the strong tensor product $G\otimes' H$ is 1-factorable, if $G$ is 1-factorable.

PDF 1FactorisationOfTheCompositionOfRegularGraphs.pdf - Other
Download (139kB)

More information

Published date: 1983
Keywords: Regular graph, edge-colouring, 1-factorization
Organisations: Electronics & Computer Science


Local EPrints ID: 259862
ISSN: 0350-1302
PURE UUID: da978eae-42b7-476c-8075-6d999b1fcd69

Catalogue record

Date deposited: 31 Aug 2004
Last modified: 18 Jul 2017 09:19

Export record


Author: T. Pisanski
Author: J. Shawe-Taylor
Author: B. Mohar

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.