REAL

Terminal-Pairability in Complete Bipartite Graph of Non-Bipartite Demands

Colucci, Lucas and Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert (2018) Terminal-Pairability in Complete Bipartite Graph of Non-Bipartite Demands. THEORETICAL COMPUTER SCIENCE, 107. pp. 221-231. ISSN 0304-3975

[img]
Preview
Text
1705.02124v4.pdf

Download (211kB) | Preview
Item Type: Article
Subjects: Q Science / természettudomány > QA Mathematics / matematika
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 12 Jan 2019 08:36
Last Modified: 12 Jan 2019 08:36
URI: http://real.mtak.hu/id/eprint/89753

Actions (login required)

Edit Item Edit Item