Excluding a planar matching minor in bipartite graphs
DOI10.1016/j.jctb.2023.09.003arXiv2106.00703OpenAlexW3167854799MaRDI QIDQ6144397
Stephan Kreutzer, Sebastian Wiederrecht, Archontia C. Giannopoulou
Publication date: 29 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.00703
digraphsperfect matchingErdős-Pósa propertydisjoint pathsbutterfly minormatching minorcounting perfect matchings
Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing directed circuits exactly
- Graph minors. XX: Wagner's conjecture
- Graph minors. V. Excluding a planar graph
- Characterization of even directed graphs
- On n-extendable graphs
- S-functions for graphs
- Graph minors. XVI: Excluding a non-planar graph
- Pólya's permanent problem
- A characterization of convertible (0,1)-matrices
- Directed tree-width
- Graph minors. XIII: The disjoint paths problem
- Permanents, Pfaffian orientations, and even directed circuits
- Digraphs of directed treewidth one
- Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
- Generating bricks
- Über eine Eigenschaft der ebenen Komplexe
- The point-set embeddability problem for plane graphs
- The Directed Grid Theorem
- Coverings of Bipartite Graphs
- Bipartite graphs with a perfect matching and digraphs
- Graph minors. II. Algorithmic aspects of tree-width
- The embeddings of a graph—A survey
- Even dicycles
- Classes of Directed Graphs
- Adapting the Directed Grid Theorem into an FPT Algorithm
- The Directed Flat Wall Theorem
- Paths, Trees, and Flowers
- Graph Drawing
- Two Algorithms for Bipartite Graphs
This page was built for publication: Excluding a planar matching minor in bipartite graphs
