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...
Kaydedildi:
Yazar: | Wiederrecht, Sebastian (auth) |
---|---|
Materyal Türü: | Elektronik Kitap Bölümü |
Dil: | İngilizce |
Baskı/Yayın Bilgisi: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2022
|
Seri Bilgileri: | Foundations of computing
16 |
Konular: | |
Online Erişim: | OAPEN Library: download the publication OAPEN Library: description of the publication |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Benzer Materyaller
-
Matching minors in bipartite graphs
Yazar:: Wiederrecht, Sebastian
Baskı/Yayın Bilgisi: (2022) -
Entity Alignment Concepts, Recent Advances and Novel Approaches
Yazar:: Zhao, Xiang
Baskı/Yayın Bilgisi: (2023) -
Entity Alignment Concepts, Recent Advances and Novel Approaches
Yazar:: Zhao, Xiang
Baskı/Yayın Bilgisi: (2023) -
Chapter On a theorem of Erdős and Simonovits on graphs not containing the cube
Yazar:: Füredi, Zoltán
Baskı/Yayın Bilgisi: (2013) -
Graph-Theoretic Problems and Their New Applications
Yazar:: Werner, Frank
Baskı/Yayın Bilgisi: (2020)