Pages that link to "Item:Q2922213"
From MaRDI portal
The following pages link to Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213):
Displaying 4 items.
- Complete graph immersions in dense graphs (Q512586) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Clique immersion in graph products (Q6041549) (← links)
