54 citations · 230 across the 74 of their papers we have counts for
9 papers · 1 filter
Interval minors of complete multipartite graphs
Yaping Mao, Hongjian Lai, Zhao Wang +1
Interval minors of bipartite graphs were introduced by Jacob Fox in the study of Stanley-Wilf limits. Recently, Mohar, Rafiey, Tayfeh-Rezaie and Wu investigated the maximum number…
The Steiner diameter of a graph
Yaping Mao
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected…
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
Yaping Mao
The concept of pedant tree-connectivity was introduced by Hager in 1985. For a graph and a set of at least two vertices, \emph{an -Steiner tree} or \…
On the pedant tree-connectivity of graphs
Yaping Mao
The concept of pedant tree-connectivity was introduced by Hager in 1985. For a graph and a set of at least two vertices, \emph{an -Steiner tree} or \…
On the Equitable Vertex Arboricity of Graphs
Yaping Mao, Zhiwei Guo, Hongjian Lai +1
The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu, Zhang and Li introduced the concept of equitable $(t,k)…
Proper connection number and graph products
Yaping Mao, Fengnan Yanling, Zhao Wang +1
A path in an edge-colored graph is called \emph{a proper path} if no two adjacent edges of are colored the same, and is \emph{proper connected} if every two vertice…