The following pages link to (Q3139528):
Displayed 12 items.
- Note on terminal-pairability in complete grid graphs (Q512572) (← links)
- An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885) (← links)
- On path-pairability in the Cartesian product of graphs (Q726652) (← links)
- A communication problem and directed triple systems (Q1392553) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- Note on the bisection width of cubic graphs (Q2197453) (← links)
- On the maximum diameter of path-pairable graphs (Q2287755) (← links)
- On the maximum degree of path-pairable planar graphs (Q2415080) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Minimal 2-connected graphs satisfying the even cut condition (Q2656344) (← links)
- The terminal-pairability problem in complete bipartite graphs (Q2659062) (← links)
- Networks communicating for each pairing of terminals (Q4022728) (← links)