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!
|
LEADER | 01868nam-a2200289z--4500 | ||
---|---|---|---|
001 | 993549278004498 | ||
005 | 20231214133046.0 | ||
006 | m o d | ||
007 | cr|mn|---annan | ||
008 | 202207s2022 xx |||||o ||| 0|eng d | ||
035 | |a (CKB)5700000000101233 | ||
035 | |a (oapen)https://directory.doabooks.org/handle/20.500.12854/87653 | ||
035 | |a (EXLCZ)995700000000101233 | ||
041 | 0 | |a eng | |
100 | 1 | |a Wiederrecht, Sebastian |4 auth | |
245 | 1 | 0 | |a Matching minors in bipartite graphs |
260 | |a Berlin |b Universitätsverlag der Technischen Universität Berlin |c 2022 | ||
300 | |a 1 electronic resource (476 p.) | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
490 | 1 | |a Foundations of computing | |
520 | |a 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. here we show that the disjoint alternating paths problem can be solved in polynomial time on graphs of bounded width. Moreover, we show that every bipartite graph with high perfect matching width must contain a large grid as a matching minor. Finally, we prove an analogue of the we known Flat Wall theorem and provide a qualitative description of all bipartite graphs which exclude a fixed matching minor. | ||
546 | |a English | ||
650 | 7 | |a Algorithms & data structures |2 bicssc | |
653 | |a matching minor; structural graph theory; bipartite; perfect matching | ||
776 | |z 3-7983-3252-5 | ||
906 | |a BOOK | ||
ADM | |b 2023-12-15 05:41:16 Europe/Vienna |f system |c marc21 |a 2022-07-14 08:50:39 Europe/Vienna |g false | ||
AVE | |i DOAB Directory of Open Access Books |P DOAB Directory of Open Access Books |x https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338973110004498&Force_direct=true |Z 5338973110004498 |b Available |8 5338973110004498 |