Colucci, Lucas and Erdős, Péter and Győri, Ervin and Mezei, Tamás (2017) Terminal-Pairability in Complete Bipartite Graphs. DISCRETE APPLIED MATHEMATICS, & (&). pp. 1-5. ISSN 0166-218X
|
Text
1702.04313v2.pdf Download (174kB) | Preview |
Official URL: https://doi.org/10.1016/j.dam.2017.10.026
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Graph theory; LOWER BOUNDS; Demand graphs; Mathematical techniques; Combinatorial mathematics; Terminal-pairability; Complete bipartite graphs |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 13 Dec 2017 13:43 |
| Last Modified: | 13 Dec 2017 13:43 |
| URI: | http://real.mtak.hu/id/eprint/71043 |
Actions (login required)
 |
Edit Item |
