The following pages link to Edge-colouring of join graphs (Q2369004):
Displayed 15 items.
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← 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)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← 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 regular graphs of large degree (Q2465629) (← links)
- Sufficient conditions for a graph to be edge-colorable with maximum degree colors (Q3503532) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
- On the edge chromatic vertex stability number of graphs (Q6166229) (← links)