Mathematics
Combinatorics
Scientist
Finding Short Cycles in an Embedded Graph in Polynomial Time
Fundamental Cycles and Graph Embeddings
Lower bound on the number of the maximum genus embedding of $K_{n,n}$
The extremal genus embedding of graphs
Vertex Splitting and Upper Embeddable Graphs
No associations
LandOfFree
Han Ren does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Han Ren, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Han Ren will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-175571