198 citations
- Lanzhou UniversityCN37 papers
- Institute of Theoretical PhysicsCN14 papers
- Nankai UniversityCN13 papers
- Institute of Modern PhysicsCN11 papers
- Ludong UniversityCN6 papers
- Oakland UniversityUS5 papers
- Beijing Normal UniversityCN4 papers
- China Jiliang UniversityCN4 papers
- Qinghai UniversityCN4 papers
- Georgia Southern UniversityUS3 papers
- Northwest Normal UniversityCN3 papers
- Chinese Academy of SciencesCN2 papers
8 papers · 2 filters
Hardness result for the total rainbow -connection of graphs
Wenjing Li, Xueliang Li, Di Wu
A path in a total-colored graph is called \emph{total rainbow} if its edges and internal vertices have distinct colors. For an -connected graph and an integer with $1…
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)…