The chromatic index of complete multipartite graphs
From MaRDI portal
Publication:4013418
DOI10.1002/jgt.3190160207zbMath0760.05041MaRDI QIDQ4013418
Publication date: 27 September 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160207
Related Items
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs, Packing arrays, 5-cycle systems with holes, Recent results on the total chromatic number, On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs, The Doyen-Wilson theorem extended to 5-cycles, Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\), On edge-colouring indifference graphs, The achromatic indices of the regular complete multipartite graphs, Edge-colouring of join graphs, Edge-colouring of regular graphs of large degree, Resolvable 4-cycle group divisible designs with two associate classes: part size even, The total chromatic number of some bipartite graphs, On minimum sets of 1-factors covering a complete multipartite graph
Cites Work