The terminal-pairability problem in complete bipartite graphs

DOI10.1016/j.dam.2020.12.003zbMath1460.05039OpenAlexW3113159177MaRDI QIDQ2659062

Zequn Lv, Mei Lu

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

zbMATH Keywords

bipartite graphdemand graphterminal-pairability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (1)

Keep your distance: land division with separation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on terminal-pairability in complete grid graphs
• On path-pairability in the Cartesian product of graphs
• A communication problem and directed triple systems
• Terminal-pairability in complete bipartite graphs
• Graph minors. XIII: The disjoint paths problem
• The list chromatic index of a bipartite multigraph
• Terminal-Pairability in Complete Graphs
• Networks communicating for each pairing of terminals
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: The terminal-pairability problem in complete bipartite graphs