Pages that link to "Item:Q1322192"
From MaRDI portal
The following pages link to Packing pentagons into complete graphs: How clumsy can you get? (Q1322192):
Displaying 9 items.
- Almost resolvable maximum packings of complete graphs with 5-cycles (Q893340) (← links)
- Packing cycles in complete graphs (Q947728) (← links)
- Maximum packings with odd cycles (Q1332431) (← links)
- Six-cycle systems (Q2054649) (← links)
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) (Q2471048) (← links)
- The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar (Q2663662) (← links)
- Maximum packings of the complete graph with uniform length cycles (Q3174232) (← links)
- Packings and Coverings of the Complete Bipartite Graph by Octagons (Q5069682) (← links)
- (Q5109056) (← links)
