1 citations · 1 across the 11 of their papers we have counts for
11 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…
On the sizes of bipartite 1-planar graphs
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
A graph is called -planar if it admits a drawing in the plane such that each edge is crossed at most once. Let be a bipartite 1-planar graph with () vertices and…
New upper bounds for the crossing numbers of crossing-critical graphs
Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang +1
A graph is {-crossing-critical} if , but for each edge , where is the crossing number of . It is known that for any $k…
Lower bound on the number of the maximum genus embedding of
Guanghua Dong, Han Ren, Ning Wang +1
In this paper, we provide an method to obtain the lower bound on the number of the distinct maximum genus embedding of the complete bipartite graph Kn;n (n be an odd number), which…
Joint-tree model and the maximum genus of graphs
Guanghua Dong, Ning Wang, Yuanqiu Huang +1
The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and °M(G - v) =…
Vertex Splitting and Upper Embeddable Graphs
Guanghua Dong, Ning Wang, Yuanqiu Huang +2
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of up…