22 citations · 40 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 2 cited
Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number
Xiaofeng Gu, Hong-Jian Lai, Ping Li +1
With graphs considered as natural models for many network design problems, edge connectivity and maximum number of edge-disjoint spanning trees of a graph have b…
math.CO2014★ 10 cited
Spanning rigid subgraph packing and sparse subgraph covering
Xiaofeng Gu
Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, a…