The terminal-pairability problem in complete bipartite graphs
From MaRDI portal
Publication:2659062
DOI10.1016/J.DAM.2020.12.003zbMATH Open1460.05039OpenAlexW3113159177MaRDI QIDQ2659062FDOQ2659062
Publication date: 25 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.003
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
- Graph minors. XIII: The disjoint paths problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- The list chromatic index of a bipartite multigraph
- Title not available (Why is that?)
- Networks communicating for each pairing of terminals
- Title not available (Why is that?)
- Terminal-pairability in complete bipartite graphs
- Title not available (Why is that?)
- Note on terminal-pairability in complete grid graphs
- On path-pairability in the Cartesian product of graphs
- Title not available (Why is that?)
- A communication problem and directed triple systems
- Terminal-pairability in complete graphs
Cited In (6)
- Terminal-pairability in complete graphs
- An improved upper bound on the maximum degree of terminal-pairable complete graphs
- Keep your distance: land division with separation
- Note on terminal-pairability in complete grid graphs
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- Terminal-pairability in complete bipartite 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)
