1 citations · 3 across the 4 of their papers we have counts for
4 papers
Line k-Arboricity in Product Networks
Yaping Mao, Zhiwei Guo, Nan Jia +1
A \emph{linear -forest} is a forest whose components are paths of length at most . The \emph{linear -arboricity} of a graph , denoted by , is the least n…
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…
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)…
On the regular k-independence number of graphs
Zhiwei Guo, Haixing Zhao, Hongjian Lai +1
The \emph{regular independence number}, introduced by Albertson and Boutin in 1990, is the maximum cardinality of an independent set of in which all vertices have equal degree…