Determining All Maximum Uniquely Restricted Matching in Bipartite Graphs
Computational Complexity
2010-09-29 v1 Data Structures and Algorithms
Abstract
The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted matching in a bipartite graph is equivalent to recognition a acyclic digraph. Based on these results, it proves that determine the bipartite graphs with all maximum matching are uniquely restricted is polynomial time. This answers an open question of Levit and Mandrescu(Discrete Applied Mathematics 132(2004) 163-164).
Keywords
Cite
@article{arxiv.1009.5435,
title = {Determining All Maximum Uniquely Restricted Matching in Bipartite Graphs},
author = {Guohun Zhu},
journal= {arXiv preprint arXiv:1009.5435},
year = {2010}
}
Comments
9 pages, 5 figures