3 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
Some sufficient conditions on Hamiltonian digraph
Guohun Zhu
Z-mapping graph is a balanced bipartite graph of a digraph by split each vertex of into a pair of vertices of . Based on the property of the , it is proved that i…
The Complexity of Determining Existence a Hamiltonian Cycle is
Guohun Zhu
The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in grap…
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…