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), 193-196.
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.
|Keywords:||Regular graph, edge-colouring, 1-factorization|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science
|Date Deposited:||31 Aug 2004|
|Last Modified:||02 Mar 2012 13:20|
|Contributors:||Pisanski, T. (Author)
Shawe-Taylor, J. (Author)
Mohar, B. (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)