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]
@article{ColucciEGM19,
title = {Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs},
author = {Lucas Colucci and Péter L. Erdös and Ervin Györi and Tamás Róbert Mezei},
year = {2019},
doi = {10.1016/j.tcs.2018.12.007},
url = {https://doi.org/10.1016/j.tcs.2018.12.007},
researchr = {https://researchr.org/publication/ColucciEGM19},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {775},
pages = {16-25},
}