Pages that link to "Item:Q1356779"
From MaRDI portal
The following pages link to Edge coloring regular graphs of high degree (Q1356779):
Displaying 16 items.
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
- Edge coloring nearly bipartite graphs (Q1306362) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← links)
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
- Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)
