Matching minors in bipartite graphs
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for the study of matching minors and investigate a connection to the study of directed graphs. We develope matching theoretic to established results of graph minor theory: We characterise the existence of...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Elektroninen Kirjan osa |
| Kieli: | englanti |
| Julkaistu: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2022
|
| Sarja: | Foundations of computing
16 |
| Aiheet: | |
| Linkit: | OAPEN Library: download the publication OAPEN Library: description of the publication |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|
Internet
OAPEN Library: download the publicationOAPEN Library: description of the publication
3rd Floor Main Library
| Hyllypaikka: |
A1234.567 |
|---|---|
| Nide 1 | Saatavissa |