Author:
Dulmage A. L.,Mendelsohn N. S.
Abstract
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 inadmissible edges of a graph is to obstruct certain
natural coverings of the graph.
Publisher
Canadian Mathematical Society
Cited by
220 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献