7 citations · 7 across the 3 of their papers we have counts for
3 papers
math.CO2017
On Perfect Matchings in Matching Covered Graphs
Jinghua He, Erling Wei, Dong Ye +1
Let be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset of is feasible if there exists two perfect matchings and $M_2…
math.CO2015
Matching preclusion for vertex-transitive networks
Qiuli Li, Jinghua He, Heping Zhang
In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let be a graph of even order. The matching preclusion number i…
math.AC2009★ 7 cited
Algebraic properties of the path ideal of a tree
Jing Jane He, Adam Van Tuyl
The path ideal (of length t >=2) of a graph G is the monomial ideal, denoted I_t(G), whose generators correspond to the directed paths of length t in G. We study some of the algebr…