The chromatic index of complete multipartite graphs
From MaRDI portal
Publication:4013418
DOI10.1002/JGT.3190160207zbMATH Open0760.05041OpenAlexW2061372647MaRDI QIDQ4013418FDOQ4013418
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
Recommendations
Cites Work
Cited In (59)
- Packing arrays
- On the edge chromatic vertex stability number of graphs
- On edge-colouring indifference graphs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- The achromatic indices of the regular complete multipartite graphs
- Recent results on the total chromatic number
- On the coequal values of total chromatic number and chromatic index
- Regular handicap graphs of order $n \equiv 0$ (mod 8)
- The edge cover chromatic index of complete tripartite graphs
- Minimum total coloring of planar graph
- On the chromatic index of path decompositions
- The Doyen-Wilson theorem extended to 5-cycles
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
- Total-colorings of complete multipartite graphs using amalgamations
- Resolvable 4-cycle group divisible designs with two associate classes: part size even
- Edge-colouring of joins of regular graphs. I
- Edge-colouring graphs with bounded local degree sums
- Proper rainbow connection number of graphs
- The number of disjoint perfect matchings in semi-regular graphs
- Title not available (Why is that?)
- The total chromatic number of complete multipartite graphs with low deficiency
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Chromatic index of graphs with no cycle with a unique chord
- The chromatic index of graphs of even order with many edges
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
- Orthogonal one-factorizations of complete multipartite graphs
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
- Title not available (Why is that?)
- Edge-colouring of regular graphs of large degree
- On edge-colouring indifference graphs
- On the palette index of complete bipartite graphs
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Some multi-color Ramsey numbers on stars versus path, cycle or wheel
- Overfullness of critical class 2 graphs with a small core degree
- Chromatic index of simple hypergraphs
- On minimum sets of 1-factors covering a complete multipartite graph
- Set and size multipartite Ramsey numbers for stars
- The total chromatic number of some bipartite graphs
- Title not available (Why is that?)
- On the chromaticity of complete multipartite graphs with certain edges added
- The chromatic index of strongly regular graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- On evenly-equitable, balanced edge-colorings and related notions
- The chromatic index of graphs of high maximum degree
- Edge-colouring of joins of regular graphs. II
- The chromatic index of multigraphs that are nearly full
- Hamilton path decompositions of complete multipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-colouring of join graphs
- 5-cycle systems with holes
- On the AVDTC of Sierpiński-type graphs
- Multicolor Ramsey number of stars versus a path
- The overfull conjecture on split-comparability and split-interval graphs
- Total colorings of complete multipartite graphs using amalgamations
- On total chromatic number of complete multipartite graphs
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
- Regular handicap graphs of order n ≡ 4 (mod 8)
- On the chromatic index of complementary prisms
This page was built for publication: The chromatic index of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013418)
