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...
Saved in:
Main Author: | Wiederrecht, Sebastian (auth) |
---|---|
Format: | Electronic Book Chapter |
Language: | English |
Published: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2022
|
Series: | Foundations of computing
|
Subjects: | |
Online Access: | DOAB: download the publication DOAB: description of the publication |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Matching minors in bipartite graphs
by: Wiederrecht, Sebastian
Published: (2022) -
Entity Alignment Concepts, Recent Advances and Novel Approaches
by: Zhao, Xiang
Published: (2023) -
Entity Alignment Concepts, Recent Advances and Novel Approaches
by: Zhao, Xiang
Published: (2023) -
Chapter On a theorem of Erdős and Simonovits on graphs not containing the cube
by: Füredi, Zoltán
Published: (2013) -
Graph-Theoretic Problems and Their New Applications
by: Werner, Frank
Published: (2020)