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:
Superior document: | Foundations of computing |
---|---|
: | |
Year of Publication: | 2022 |
Language: | English |
Series: | Foundations of computing
|
Physical Description: | 1 electronic resource (476 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast parallel algorithms for graph matching problems / Marek Karpinski and Wojciech Rytter
by: Karpinski, Marek
Published: (1998) -
The pre-flavian garrisons of Valkenburg Z.H. : fabriculae and bipartite barracks / W. Glasbergen ; W. Groenman-van Waateringe
by: Glasbergen, W.
Published: (1974) -
Matching / Kenneth J. Rothman and Sander Greenland
by: Rothman, Kennet J.
Published: (1998) -
Matching / Patricia Hartge and Jack Cahill
by: Hartge, Patricia
Published: (1998) -
Matching / Kenneth J. Rothman and Sander Greenland
by: Rothman, Kenneth J.
Published: (1998)