Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. L. W. Beineke and S. Fiorini, On small graphs critical with respect to edge colourings, Discrete Math. (to appear).
2. L. W. Beineke and R. J. Wilson, On the edge-chromatic number of a graph, Discrete Math. 5 (1973), 15–20.
3. N. Biggs, An edge-colouring problem, Amer. Math. Monthly 79 (1972), 1018–1020.
4. F. Castagna and G. Prins, Every generalized Petersen graph has a Tait coloring, Pacific J. Math. 40 (1972), 53–58.
5. P. Erdös and R J. Wilson, On the chromatic index of almost all graphs, J. Combinatorial Theory (to appear).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献