3 citations · 3 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2010
Determining All Maximum Uniquely Restricted Matching in Bipartite Graphs
Guohun Zhu
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 matchi…
cs.CC2007★ 3 cited
The Complexity of HCP in Digraps with Degree Bound Two
Guohun Zhu
The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple…