Pages that link to "Item:Q2465629"
From MaRDI portal
The following pages link to Edge-colouring of regular graphs of large degree (Q2465629):
Displaying 7 items.
- Edge-colouring of joins of regular graphs. I (Q849137) (← 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)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← 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)
