Pages that link to "Item:Q4013418"
From MaRDI portal
The following pages link to The chromatic index of complete multipartite graphs (Q4013418):
Displaying 39 items.
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- On evenly-equitable, balanced edge-colorings and related notions (Q499817) (← links)
- Packing arrays (Q596146) (← links)
- 5-cycle systems with holes (Q677163) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- The total chromatic number of complete multipartite graphs with low deficiency (Q897273) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs (Q1126293) (← links)
- The Doyen-Wilson theorem extended to 5-cycles (Q1336451) (← links)
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) (Q1363688) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Hamilton path decompositions of complete multipartite graphs (Q1719570) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Set and size multipartite Ramsey numbers for stars (Q1801084) (← links)
- The achromatic indices of the regular complete multipartite graphs (Q1894758) (← links)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← links)
- Some multi-color Ramsey numbers on stars versus path, cycle or wheel (Q2175786) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Orthogonal one-factorizations of complete multipartite graphs (Q2414929) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- Resolvable 4-cycle group divisible designs with two associate classes: part size even (Q2468011) (← links)
- Proper rainbow connection number of graphs (Q2656335) (← links)
- Overfullness of critical class 2 graphs with a small core degree (Q2673482) (← links)
- The chromatic index of strongly regular graphs (Q3390046) (← links)
- The total chromatic number of some bipartite graphs (Q3439400) (← links)
- On minimum sets of 1-factors covering a complete multipartite graph (Q3522849) (← links)
- Regular handicap graphs of order $n \equiv 0$ (mod 8) (Q5009981) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
- Regular handicap graphs of order n ≡ 4 (mod 8) (Q5081226) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
- On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)
