Author:
Johnson Diane M.,Dulmage A. L.,Mendelsohn N. S.
Abstract
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 that for every directed graph there exists a certain bipartite graph such that the directed graph is connected if and only if the bipartite graph is irreducible. Other connections between reducibility and connectivity are established.
Publisher
Canadian Mathematical Society
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献