Published in

Elsevier, Theoretical Computer Science, (775), p. 16-25, 2019

DOI: 10.1016/j.tcs.2018.12.007

Links

Tools

Export citation

Search in Google Scholar

Terminal-pairability in complete bipartite graphs with non-bipartite demands

Journal article published in 2019 by Lucas Colucci, Péter L. Erdős ORCID, Ervin Győri, Tamás Róbert Mezei ORCID
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Upload
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO