160 citations · 175 across the 11 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012
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) =…
math.CO2012
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…