The terminal-pairability problem in complete bipartite graphs
From MaRDI portal
Publication:2659062
Recommendations
- Terminal-pairability in complete bipartite graphs
- Terminal-pairability in complete graphs
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- An improved upper bound on the maximum degree of terminal-pairable complete graphs
- Note on terminal-pairability in complete grid graphs
Cites work
- scientific article; zbMATH DE number 434691 (Why is no real title available?)
- scientific article; zbMATH DE number 90343 (Why is no real title available?)
- scientific article; zbMATH DE number 1286752 (Why is no real title available?)
- scientific article; zbMATH DE number 3266380 (Why is no real title available?)
- A communication problem and directed triple systems
- Graph minors. XIII: The disjoint paths problem
- Networks communicating for each pairing of terminals
- Note on terminal-pairability in complete grid graphs
- On path-pairability in the Cartesian product of graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- Terminal-pairability in complete bipartite graphs
- Terminal-pairability in complete graphs
- The list chromatic index of a bipartite multigraph
Cited in
(6)- Terminal-pairability in complete graphs
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- Keep your distance: land division with separation
- An improved upper bound on the maximum degree of terminal-pairable complete graphs
- Terminal-pairability in complete bipartite graphs
- Note on terminal-pairability in complete grid graphs
This page was built for publication: The terminal-pairability problem in complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659062)
