External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

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.

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]

Authors

Lucas Colucci

This author has not been identified. Look up 'Lucas Colucci' in Google

Péter L. Erdös

This author has not been identified. Look up 'Péter L. Erdös' in Google

Ervin Györi

This author has not been identified. Look up 'Ervin Györi' in Google

Tamás Róbert Mezei

This author has not been identified. Look up 'Tamás Róbert Mezei' in Google
runs on