Chetwynd, Amanda G. and Hilton, A. J. W. (1985) *Regular Graphs of High Degree are 1-Factorizable.* Proceedings of the London Mathematical Society, Series (2). pp. 193-206. ISSN 1460-244X

Official URL: http://dx.doi.org/10.1112/plms/s3-50.2.193

## Abstract

It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n—1 or 2n—2. We show here that it is true for d(G) equal to 2n — 3, 2n — 4, or 2n — 5. We also show that it is true for d(G) |V(G)|.

Item Type: | Article |
---|---|

Journal or Publication Title: | Proceedings of the London Mathematical Society |

Subjects: | Q Science > QA Mathematics |

Departments: | Faculty of Science and Technology > Mathematics and Statistics VC's Office |

ID Code: | 19965 |

Deposited By: | Prof Amanda Chetwynd |

Deposited On: | 21 Nov 2008 16:25 |

Refereed?: | Yes |

Published?: | Published |

Last Modified: | 22 Jul 2016 01:04 |

Identification Number: | |

URI: | http://eprints.lancs.ac.uk/id/eprint/19965 |

### Actions (login required)

View Item |