1 citations · 1 across the 7 of their papers we have counts for
8 papers
The generalized 4-connectivity of godan graphs
Jing Wang, Yuanqiu Huang, Zhangdong Ouyang
The generalized -connectivity of a graph , denoted by , is the minimum number of internally edge disjoint -trees for any and . The general…
The generalized 4-connectivity of burnt pancake graphs
Jing Wang, Jiang Wu, Zhangdong Ouyang +1
The generalized -connectivity of a graph , denoted by , is the minimum number of internally edge disjoint -trees for any and . The general…
On the sizes of generalized cactus graphs
Licheng Zhang, Yuanqiu Huang
A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a -cactus is a connected graph in which eac…
The generalized 3-connectivity of burnt pancake graphs and godan graphs
Jing Wang, Zuozheng Zhang, Yuanqiu Huang
The generalized -connectivity of a graph , denoted by , is the minimum number of internally edge disjoint -trees for any and . The general…
The generalized 3-connectivity of a family regular networks
Jing Wang, Xidao Luan, Yuanqiu Huang
The generalized -connectivity of a graph , denoted by , is the minimum number of internally edge disjoint -trees for any with . The genera…
On the size of matchings in 1-planar graph with high minimum degree
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recen…