|
[1] L. W. Beineke and R. J. Wilson, On the edge-chromatic number of a graph, Discrete Math. 5(1973)15-20. MR 47-4836. [2] J. A. Bondy and U. S. R. Murty, Graph theory with applications. Elsevier North Holland, Inc., (1976). [3] B. L. Chen and H. L. Fu, Total chromatic number and chromatic index of split graphs. JCMCC 17(1995), 137-146. [4] A. G. Chetwynd and A. J. W. Hilton, Star multigraphs with three vertices of maximum degree, Math. Proc. Phil. Soc., 100(1986), 303-317. [5] S. Fiorini and R. J. Wilson, Edge-colorings of graphs, Pitman, London(1977). [6] J. C. Fournier, Colorations des aretes d'un graphe. Cahiers du CERO, 15(1973), 311-314.[7] M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic, New York(1980). [8] A. J. W. Hilton, Definitions of criticality with respect to edge-coloring, J. Graph Theory 1(1977), 61-68. [9] M. J. Plantholt, The chromatic index of graphs with a spanning star, J. Graph Theory 5(1981), 5-13. [10] M. J. Plantholt, The chromatic index of graphs with large maximum degree, Discrete Math. 47(1983), 91-96. [11] V. G. Vizing, On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz.,3(1964), 25-30.
|