Chetwynd, Amanda G. and Hilton, A. J. W. (1989) 1-factorizing regular graphs of high degree—an improved bound. Discrete Mathematics, 75 (1-3). pp. 103-112. ISSN 0012-365X
Full text not available from this repository.Official URL: http://dx.doi.org/10.1016/0012-365X(89)90082-4
Abstract
We showed earlier that a regular simple graph of even order satisfying d(G) V(G) was the union of edge-disjoint 1-factors. Here we improve this to regular simple graphs of even order satisfying d(G) (√7−1)V(G).
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Discrete Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Departments: | Faculty of Science and Technology > Mathematics and Statistics VC's Office |
| ID Code: | 20948 |
| Deposited By: | Prof Amanda Chetwynd |
| Deposited On: | 05 Dec 2008 09:02 |
| Refereed?: | No |
| Published?: | Published |
| Last Modified: | 26 Jul 2012 15:42 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/20948 |
Actions (login required)
| View Item |
