3 citations · 3 across the 5 of their papers we have counts for
5 papers
The extremal genus embedding of graphs
Guanghua Dong, Han Ren, Ning Wang +1
Let Wn be a wheel graph with n spokes. How does the genus change if adding a degree-3 vertex v, which is not in V (Wn), to the graph Wn? In this paper, through the joint-tree model…
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…
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…
Fundamental Cycles and Graph Embeddings
Han Ren, Hongtao Zhao, Haoling Li
In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we fin…
Finding Short Cycles in an Embedded Graph in Polynomial Time
Han Ren, Ni Cao
Let be the set of fundamental cycles of breadth-first-search trees in a graph and the set of the sums of two cycles in . Then we show t…