LEADER 02020nam  2200337z- 450 
001 9910582201003321
005 20231214133046.0
010   $a3-7983-3253-3
035   $a(CKB)5700000000101233
035   $a(oapen)https://directory.doabooks.org/handle/20.500.12854/87653
035   $a(EXLCZ)995700000000101233
100   $a20202207d2022      |y         0
101 0 $aeng
135   $aurmn|---annan
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aMatching minors in bipartite graphs
210   $aBerlin$cUniversitätsverlag der Technischen Universität Berlin$d2022
215   $a1 electronic resource (476 p.)
225 1 $aFoundations of computing
311 08$a3-7983-3252-5 
330   $aIn 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.
606   $aAlgorithms & data structures$2bicssc
610   $amatching minor; structural graph theory; bipartite; perfect matching
615  7$aAlgorithms & data structures
700   $aWiederrecht$b Sebastian$4auth$01293616
906   $aBOOK
912   $a9910582201003321
996   $aMatching minors in bipartite graphs$93022664
997   $aUNINA