Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Regular graphs of high degree are 1-factorizable;Chetwynd,1985
2. 1-factorizing regular graphs of high degree — an improved bound;Chetwynd;Discrete Math.,1989
3. A Δ-subgraph condition for a graph to be class 1;Chetwynd;J. Combin. Theory (B),1989
4. The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small;Chetwynd;J. Combin. Theory (B),1990
5. K.H. Chew, Total chromatic number of graphs of high maximum degree, J. Combin. Math. and Combin. Comput., to appear.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献