1. Regular graphs of high degree are 1-factorizable;Chetwynd;Proc. London Math. Soc.,1985
2. A.G. Chetwynd and A.J.W. Hilton, The edge-chromatic class of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small, J. Combinatorial Theory (B) to appear.
3. Partial edge-colourings of complete graphs or of graphs which are nearly complete;Chetwynd;Graph Theory and Combinatorics,1984
4. The chromatic index of graphs of even order with many edges;Chetwynd;J. Graph Theory,1984
5. A.G. Chetwynd and A.J.W. Hilton, The edge-chromatic class of graphs with maximum degree at least ⋎V⋎ – 3, Proceedings of the conference held in Denmark in memory of G.A. Dirac, to appear.