1. Graphs and hypergraphs;Berge,1973
2. Partial edge-colourings of complete graphs or of graphs which are nearly complete;Chetwynd,1984
3. Regular graphs of high degree are 1-factorizable;Chetwynd;Proc. London Math. Soc.,1985
4. The chromatic class of graphs with at most four vertices of maximum degree;Chetwynd;Congr. Numer.,1984
5. 1-factorizing regular graphs of high degree-an improved bound;Chetwynd;Discrete Math.,1989