1. Partial edge-colourings of complete graphs or of graphs which are nearly complete;Chetwynd;Graph Theory and Combinatorics,1984
2. The chromatic index of graphs of even order with many edges;Chetwynd;J. Graph Theory,1984
3. Regular graphs of high degree are 1-factorizable;Chetwynd,1985
4. A.G. Chetwynd and A.J.W. Hilton, The chromatic class of graphs with at most four vertices of maximum degree, Congressus Numerantium 43, Proc. 15th Southeastern Conf. on Combinatorics. Graph Theory and Computing. 221–248.
5. A.G. Chetwynd and A.J.W. Hilton, The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small, subsmitted.