Pages that link to "Item:Q2465629"
From MaRDI portal
The following pages link to Edge-colouring of regular graphs of large degree (Q2465629):
Displaying 20 items.
- Edge-colouring seven-regular planar graphs (Q491000) (← links)
- Edge-colouring eight-regular planar graphs (Q491001) (← links)
- A graph coloring problem (Q745647) (← links)
- Regular graphs and edge chromatic number (Q790826) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Amalgamations of almost regular edge-colourings of simple graphs (Q1108284) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Edge-coloring critical graphs with high degree (Q1850002) (← links)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← 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-colorings of some large graphs on alphabets (Q2713603) (← links)
- Optimal edge coloring of large graphs (Q4262695) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
- A conjecture on edge coloring of graphs (Q5143707) (← links)
- Edge Colorings and Circular Flow Numbers of Regular Graphs (Q5251196) (← links)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
