# Coverings of Bipartite Graphs

```@article{Dulmage1958CoveringsOB,
title={Coverings of Bipartite Graphs},
author={A. L. Dulmage and N. S. Mendelsohn},
year={1958},
volume={10},
pages={517 - 534}
}```
• Published 1958
• Mathematics
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core. It is also possible to decompose the core into irreducible parts and thus obtain a canonical reduction of the graph. The concept of irreducibility is very easily and naturally expressed in terms of exterior coverings. The role of the…
434 Citations
• Mathematics
• 1962
Corresponding to every graph, bipartite graph, or directed bipartite graph there exists a directed graph which is connected if and only if the original graph is connected. In this paper, it is shown
• Mathematics
SIAM J. Discret. Math.
• 2018
This paper shows that the problem of making a given bipartite graph DM-irreducible by adding edges can be formulated as a special case of a general framework of covering supermodular functions, which was introduced by Frank and Jordan (1995) to investigate the directed connectivity augmentation problem.
• Mathematics
• 2011
One of the most striking impacts between geometry, combinatorics and graph theory, on one hand, and algebra and group theory, on the other hand, arise from a concrete necessity to manipulate with the
• Mathematics
• 2018
The Dulmage–Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A
• Mathematics
• 1967
A set of points M of a graph G is a point cover if each line of G is incident with at least one point of M. A minimum cover (abbreviated m.c.) for G is a point cover with a minimum number of points.
• Mathematics
• 2020
We investigate efficient randomized methods for approximating the number of perfect matchings in bipartite graphs and general undirected graphs. Our approach is based on assigning probabilities to
• Mathematics
J. Graph Theory
• 1994
It is shown that sets of the form S (G) are convex and that max S(G) ≦ 2 min S( G) and that the first problem is NP-complete and the latter is polynomial.
Given a bipartite graph G = (U ∪ V,E) such that |U | = |V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine whether or not there exists a
• Mathematics
ArXiv
• 2022
By a seminal result of Valiant, computing the permanent of (0, 1)-matrices is, in general, #P-hard. In 1913 Pólya asked for which (0, 1)-matrices A it is possible to change some signs such that the