Two Disjoint Alternating Paths in Bipartite Graphs

10/05/2021
by   Archontia C. Giannopoulou, et al.
0

A bipartite graph B is called a brace if it is connected and every matching of size at most two in B is contained in some perfect matching of B and a cycle C in B is called conformal if B-V(C) has a perfect matching. We show that there do not exist two disjoint alternating paths that form a cross over a conformal cycle C in a brace B if and only if one can reduce B, by an application of a matching theoretic analogue of small clique sums, to a planar brace H in which C bounds a face. We then utilise this result and provide a polynomial time algorithm which solves the 2-linkage problem for alternating paths in bipartite graphs with perfect matchings.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 39

06/01/2021

Excluding a Planar Matching Minor in Bipartite Graphs

Matching minors are a specialisation of minors fit for the study of grap...
07/03/2019

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Motivated by adjacency in perfect matching polytopes, we study the short...
10/12/2020

An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs

We prove that a fractional perfect matching in a non-bipartite graph can...
07/02/2021

Sequential importance sampling for estimating expectations over the space of perfect matchings

This paper makes three contributions to estimating the number of perfect...
02/17/2019

Braces of Perfect Matching Width 2

A graph G is called matching covered if it is connected and every edge i...
01/28/2019

Bipartite Envy-Free Matching

Bipartite Envy-Free Matching (BEFM) is a relaxation of perfect matching....
12/07/2020

A Proof of the MV Matching Algorithm

The Micali-Vazirani (MV) algorithm for maximum cardinality matching in g...
This week in AI

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