Pages that link to "Item:Q2220965"
From MaRDI portal
The following pages link to Number of 1-factorizations of regular high-degree graphs (Q2220965):
Displaying 7 items.
- 1-factorizing regular graphs of high degree - an improved bound (Q1121901) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- (Q4430886) (← links)
- Regular Graphs of High Degree are 1-Factorizable (Q5184935) (← links)
- All regular multigraphs of even order and high degree are 1-factorable (Q5954314) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)