"Terminal-pairability in complete bipartite graphs with non-bipartite ..."

Lucas Colucci et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2018.12.007

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/ColucciEGM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ColucciEGM19
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. Theor. Comput. Sci. 775: 16-25 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.