Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Terminal-pairability in complete bipartite graphsLucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei. DAM, 236:459-463, 2018. [doi]
The following publications are possibly variants of this publication: