Pages that link to "Item:Q4406068"
From MaRDI portal
The following pages link to An algorithm for finding factorizations of complete graphs (Q4406068):
Displaying 12 items.
- Amalgamations of factorizations of complete graphs (Q885295) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (Q1061146) (← links)
- Factor-graphs and automorphism (Q1310779) (← links)
- A Lagrangian approach for minimum cost single round robin tournaments (Q1762030) (← links)
- Amalgamations of factorizations of complete equipartite graphs (Q1876684) (← links)
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations (Q2319700) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Factorisation of the complete graph into spanning regular factors (Q2689165) (← links)
- (Q3440330) (← links)
- On isomorphic graph factoring (Q3983237) (← links)
- (Q4820527) (← links)