1-factorisation of the Composition of Regular Graphs
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
1983.
|
| Subjects: | |
| Online Access: | Get fulltext |