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...
में बचाया:
मुख्य लेखक: | Wiederrecht, Sebastian (auth) |
---|---|
स्वरूप: | इलेक्ट्रोनिक पुस्तक अध्याय |
भाषा: | अंग्रेज़ी |
प्रकाशित: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2022
|
श्रृंखला: | Foundations of computing
|
विषय: | |
ऑनलाइन पहुंच: | DOAB: download the publication DOAB: description of the publication |
टैग: |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
समान संसाधन
-
Matching minors in bipartite graphs
द्वारा: Wiederrecht, Sebastian
प्रकाशित: (2022) -
Entity Alignment Concepts, Recent Advances and Novel Approaches
द्वारा: Zhao, Xiang
प्रकाशित: (2023) -
Entity Alignment Concepts, Recent Advances and Novel Approaches
द्वारा: Zhao, Xiang
प्रकाशित: (2023) -
Chapter On a theorem of Erdős and Simonovits on graphs not containing the cube
द्वारा: Füredi, Zoltán
प्रकाशित: (2013) -
Graph-Theoretic Problems and Their New Applications
द्वारा: Werner, Frank
प्रकाशित: (2020)