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.

Download

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

Description/Abstract

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.

Item Type: Article
ISSNs: 0350-1302 (print)
Related URLs:
Keywords: Regular graph, edge-colouring, 1-factorization
Organisations: Electronics & Computer Science
ePrint ID: 259862
Date :
Date Event
1983Published
Date Deposited: 31 Aug 2004
Last Modified: 17 Apr 2017 22:23
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/259862

Actions (login required)

View Item View Item