Matching minors in bipartite graphs

Dublin Core

Title

Matching minors in bipartite graphs

Subject

Algorithms & data structures

Description

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 a cross over a conformal cycle by means of a topological property. Furthermore, we develope a theory for perfect matching width, a width parameter for graphs with perfect matchings introduced by Norin.

Creator

Wiederrecht, Sebastian

Source

https://library.oapen.org/bitstream/handle/20.500.12657/57270/wiederrecht_sebastian.pdf?sequence=1

Publisher

Springer Nature

Date

2022

Contributor

Baihaqi

Rights

Creative Commons

Format

PDF

Language

English

Type

Textbooks

Files

wiederrecht_sebastian.pdf.jpg

Citation

Wiederrecht, Sebastian, “Matching minors in bipartite graphs,” Open Educational Resource (OER) - Unsyiah Library, accessed January 28, 2023, http://uilis.unsyiah.ac.id/oer/items/show/7455.

Document Viewer