Coverings of Bipartite Graphs

  title={Coverings of Bipartite Graphs},
  author={A. L. Dulmage and N. S. Mendelsohn},
  journal={Canadian Journal of Mathematics},
  pages={517 - 534}
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… 

Connectivity and Reducibility of Graphs

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

Making Bipartite Graphs DM-irreducible

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.

Links between two semisymmetric graphs on 112 vertices through the lens of association schemes

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

Making Bipartite Graphs DM-irreducible Kristóf Bérczi

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

On Indecomposable Graphs

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.

Matchings and Coverings

The results of this chapter show the close interplay between the adjacency relation Γ and the incidence M, and yield beautiful applications to combinatorics. Section 9.1 deals with independence of

Scalingmatrices and counting the perfectmatchings in graphs

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

On the NP-completeness of the perfect matching free subgraph problem

Independent edges in bipartite graphs obtained from orientations of graphs

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.

On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem

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



The convex hull of sub-permutation matrices

1. Introduction. A combinatorial theorem [1; 3] usually referred to as "the marriage problem" or "the problem of distinct representa-tives" has the following matrix formulation; the convex hull of

Some Generalizations of the Problem of Distinct Representatives

If S 1, S 2, S 3, … , S n are subsets of a set M then it is known that a necessary and sufficient condition that it is possible to choose representatives at such that ai is in S i for (i = 1, 2, 3, …

Matrices of zeros and ones

Let A be a. matrix of m rows and n columns and let the entries of A be the integers 0 and 1. We call such a matrix a (0, 1) -matrix of size m by n. The 2 (0, 1)-matrices of size m by n play a

Lattice Theory Revised Edition

Theorie der endlichen und unendlichen Graphen

Graphs and matching theorems

On a theorem of Frobenius-Kônig and J. von Neumann's game of hide and seek

  • Trans. Roy. Soc. Can. Ser. I l l ,
  • 1955