The following pages link to (Q5855397):
Displaying 4 items.
- Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges (Q5009951) (← links)
- Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges (Q6109795) (← links)
- On decompositions of complete graphs into unicyclic disconnected bipartite graphs on nine edges (Q6109799) (← links)
- \(G\)-designs for the connected triangular bicyclic graphs with nine edges (Q6671970) (← links)