Barbosa MM, de Mello CP, Meidanis J (1998) Local conditions for edge-colouring of cographs. Congr Numer 133:45–55
MATH
MathSciNet
Google Scholar
Cai L, Ellis JL (1991) NP-completeness of edge-colouring some restricted graphs. Discrete Appl Math 30:15–27
Article
MATH
MathSciNet
Google Scholar
Chen B-L, Fu H-L, Ko MT (1995) Total chromatic number and chromatic index of split graphs. J Comb Math Comb Comput 17:137–146
MATH
MathSciNet
Google Scholar
Chetwynd AG, Hilton AJW (1986) Star multigraphs with three vertices of maximum degree. Math Proc Camb Philos Soc 100:300–317
Article
MathSciNet
Google Scholar
Chetwynd AG, Hilton AJW (1989) The edge-chromatic class of graphs with even maximum degree at least |V|−3. Ann Discrete Math 41:91–110
Article
MathSciNet
Google Scholar
Coneil DG, Perl Y (1984) Clustering and domination in perfect graphs. Discrete Appl Math 9(1):27–39
Article
MathSciNet
Google Scholar
Cozzens MB, Halsey MD (1991) The relationship between the threshold dimension of split graphs and various dimensional parameters. Discrete Appl Math 30(2–3):125–135
Article
MATH
MathSciNet
Google Scholar
Figueiredo CMH, Meidanis J, de Mello CP (2000) Local conditions for edge-coloring. J Comb Math Comb Comput 32:79–91
MATH
Google Scholar
Figueiredo CMH, Meidanis J, de Mello CP (1999) Total-chromatic number and chromatic index of dually chordal graphs. Inf Process Lett 70:147–152
Article
Google Scholar
Fournier JC (1973) Coloration des arêtes d’un graphe. Cah Cent étud Rech Opér 15:311–314
MATH
MathSciNet
Google Scholar
Hilton AJW (1989) Two conjectures on edge-coloring. Discrete Math 74:61–64
Article
MATH
MathSciNet
Google Scholar
Hilton AJW, Zhao C (1992) The chromatic index of a graph whose core has maximum degree two. Discrete Math 101:135–147
Article
MATH
MathSciNet
Google Scholar
Hilton AJW, Zhao C (1996) On the edge-colouring of graphs whose core has maximum degree two. J Comb Math Comb Comput 21:97–108
MATH
MathSciNet
Google Scholar
Hoffman DG, Rodger CA (1992) The chromatic index of complete multipartite graphs. J Graph Theory 16:159–163
Article
MATH
MathSciNet
Google Scholar
Holyer I (1981) The NP-completeness of edge-coloring. SIAM J Comput 10:718–720
Article
MATH
MathSciNet
Google Scholar
König D (1916) Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math Ann 77:453–465
Article
MATH
MathSciNet
Google Scholar
Machado RCS, Figueiredo CMH (2010) Decompositions for edge-coloring join graphs and cobipartite graphs. Discrete Appl Math 158(12):1336–1342
Article
MATH
MathSciNet
Google Scholar
Makino K, Uno Y, Ibaraki T (2006) Minimum edge ranking spanning trees of split graphs. Discrete Appl Math 154(16):2373–2386
Article
MATH
MathSciNet
Google Scholar
Ortiz C, Maculan N, Szwarcfiter JL (1998) Characterizing and edge-coloring split-indifference graphs. Discrete Appl Math 82:209–217
Article
MATH
MathSciNet
Google Scholar
Plantholt MJ (1981) The chromatic index of graphs with a spanning star. J Graph Theory 5:45–53
Article
MATH
MathSciNet
Google Scholar
Plantholt MJ (1983) The chromatic index of graphs with large maximum degree. Discrete Math 47:91–96
Article
MATH
MathSciNet
Google Scholar
Royle GF (2000) Counting set covers and split graphs. J Integer Seq 3:1–5
MathSciNet
Google Scholar
Sanders DP, Zhao Y (2001) Planar graphs of maximum degree seven are Class I. J Comb Theory, Ser B 83(2):201–212
Article
MATH
MathSciNet
Google Scholar
De Simone C, de Mello CP (2006) Edge-colouring of join graphs. Theor Comput Sci 355(3):364–370
Article
MATH
Google Scholar
De Simone C, Galluccio A (2007) Edge-colouring of regular graphs of large degree. Theor Comput Sci 389(1–2):91–99
Article
MATH
Google Scholar
Tan ND, Hung LX (2006) On colorings of split graphs. Acta Math Vietnam 31(3):195–204
MATH
MathSciNet
Google Scholar
Vizing VG (1964) On an estimate of the chromatic class of a p-graph. Diskretn Anal 3:25–30
MathSciNet
Google Scholar
Vizing VG (1965) Critical graphs with a given chromatic class. Metody Diskretn Anal 5:9–17 (in Russian)
MATH
MathSciNet
Google Scholar