Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs

Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei. Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. Theoretical Computer Science, 775:16-25, 2019. [doi]

Abstract

Abstract is missing.