Pages that link to "Item:Q4009246"
From MaRDI portal
The following pages link to Regular Multigraphs of High Degree are 1-Factorizable (Q4009246):
Displaying 7 items.
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- An Asymptotic Version of the Multigraph 1‐Factorization Conjecture (Q4908822) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← 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)