Excluding a Planar Matching Minor in Bipartite Graphs

by   Archontia C. Giannopoulou, et al.

Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bipartite graphs on which the number of perfect matchings can becomputed efficiently, based on a result of Little, by McCuaig et al. in 1999.In this paper we generalise basic ideas from the graph minor series by Robertson and Seymour to the setting of bipartite graphs with perfect matchings. We introducea version of Erdos-Posa property for matching minors and find a direct link between this property and planarity. From this, it follows that a class of bipartite graphs withperfect matchings has bounded perfect matching width if and only if it excludes aplanar matching minor. We also present algorithms for bipartite graphs of bounded perfect matching width for a matching version of the disjoint paths problem, matching minor containment, and for counting the number of perfect matchings. From our structural results, we obtain that recognising whether a bipartite graphGcontains afixed planar graphHas a matching minor, and that counting the number of perfect matchings of a bipartite graph that excludes a fixed planar graph as a matching minor are both polynomial time solvable.



There are no comments yet.


page 28

page 33


Parameterizing the Permanent: Hardness for K_8-minor-free graphs

In the 1960s, statistical physicists discovered a fascinating algorithm ...

Two Disjoint Alternating Paths in Bipartite Graphs

A bipartite graph B is called a brace if it is connected and every match...

How to Secure Matchings Against Edge Failures

The matching preclusion number of a graph is the minimal number of edges...

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs

A connected graph G is called matching covered if every edge of G is con...

Planar Graph Perfect Matching is in NC

Is perfect matching in NC? That is, is there a deterministic fast parall...

Circuit Complexity of Bounded Planar Cutwidth Graph Matching

Recently, perfect matching in bounded planar cutwidth bipartite graphs (...

Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question

Graph matching consists of aligning the vertices of two unlabeled graphs...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.