Chen, Weizhen; Ji, Meng; Mao, Yaping; Wei, Meiqin Complete bipartite graphs without small rainbow stars. (English) Zbl 07737604 Discrete Appl. Math. 340, 14-20 (2023). Reviewer: Zhiwen Wang (Shanghai) MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{W. Chen} et al., Discrete Appl. Math. 340, 14--20 (2023; Zbl 07737604) Full Text: DOI arXiv
Zhou, Jiannan; Li, Zhihui; Mao, Yaping; Wei, Meiqin Ramsey and Gallai-Ramsey numbers for the union of paths and stars. (English) Zbl 1504.05188 Discrete Appl. Math. 325, 297-308 (2023). MSC: 05C55 05D10 05C76 PDFBibTeX XMLCite \textit{J. Zhou} et al., Discrete Appl. Math. 325, 297--308 (2023; Zbl 1504.05188) Full Text: DOI
Jia, Nan; Mao, Yaping; Wang, Zhao; Cheng, Eddie Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree. (English) Zbl 07465801 Math. Comput. Sci. 15, No. 4, 743-755 (2021). MSC: 05C15 05C76 05C78 PDFBibTeX XMLCite \textit{N. Jia} et al., Math. Comput. Sci. 15, No. 4, 743--755 (2021; Zbl 07465801) Full Text: DOI
Li, Yinkui; Mao, Yaping; Wang, Zhao; Wei, Zongtian Generalized connectivity of some total graphs. (English) Zbl 07396187 Czech. Math. J. 71, No. 3, 623-640 (2021). MSC: 05C05 05C40 05C70 05C75 PDFBibTeX XMLCite \textit{Y. Li} et al., Czech. Math. J. 71, No. 3, 623--640 (2021; Zbl 07396187) Full Text: DOI
Zou, Jinyu; Mao, Yaping; Magnant, Colton; Wang, Zhao; Ye, Chengfu Gallai-Ramsey numbers for books. (English) Zbl 1419.05087 Discrete Appl. Math. 268, 164-177 (2019). MSC: 05C15 05C55 05D10 05C35 PDFBibTeX XMLCite \textit{J. Zou} et al., Discrete Appl. Math. 268, 164--177 (2019; Zbl 1419.05087) Full Text: DOI arXiv
Mao, Yaping; Yanling, Fengnan; Wang, Zhao; Ye, Chengfu Proper connection number of graph products. (English) Zbl 1406.05035 Bull. Malays. Math. Sci. Soc. (2) 41, No. 4, 2041-2051 (2018). MSC: 05C15 05C40 05C76 PDFBibTeX XMLCite \textit{Y. Mao} et al., Bull. Malays. Math. Sci. Soc. (2) 41, No. 4, 2041--2051 (2018; Zbl 1406.05035) Full Text: DOI arXiv
Mao, Yaping Constructing internally disjoint pendant Steiner trees in Cartesian product networks. (English) Zbl 1383.05055 Australas. J. Comb. 70, Part 1, 28-51 (2018). MSC: 05C05 05C76 05C82 PDFBibTeX XMLCite \textit{Y. Mao}, Australas. J. Comb. 70, Part 1, 28--51 (2018; Zbl 1383.05055) Full Text: arXiv Link
Li, Xueliang; Mao, Yaping; Gutman, Ivan Inverse problem on the Steiner Wiener index. (English) Zbl 1377.05049 Discuss. Math., Graph Theory 38, No. 1, 83-95 (2018). MSC: 05C12 05C05 05C35 PDFBibTeX XMLCite \textit{X. Li} et al., Discuss. Math., Graph Theory 38, No. 1, 83--95 (2018; Zbl 1377.05049) Full Text: DOI
Mao, Yaping Constructing edge-disjoint Steiner paths in lexicographic product networks. (English) Zbl 1414.05171 Appl. Math. Comput. 308, 1-10 (2017). MSC: 05C40 05C05 05C70 05C76 90B10 PDFBibTeX XMLCite \textit{Y. Mao}, Appl. Math. Comput. 308, 1--10 (2017; Zbl 1414.05171) Full Text: DOI
Chen, Lily; Li, Xueliang; Liu, Mengmeng; Mao, Yaping A solution to a conjecture on the generalized connectivity of graphs. (English) Zbl 1358.05159 J. Comb. Optim. 33, No. 1, 275-282 (2017). MSC: 05C40 05C05 68Q25 PDFBibTeX XMLCite \textit{L. Chen} et al., J. Comb. Optim. 33, No. 1, 275--282 (2017; Zbl 1358.05159) Full Text: DOI
Li, Xueliang; Mao, Yaping Graphs with large generalized (edge-)connectivity. (English) Zbl 1350.05080 Discuss. Math., Graph Theory 36, No. 4, 931-958 (2016). MSC: 05C40 05C05 05C70 05C75 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. Mao}, Discuss. Math., Graph Theory 36, No. 4, 931--958 (2016; Zbl 1350.05080) Full Text: DOI arXiv
Li, Xueliang; Mao, Yaping; Gutman, Ivan The Steiner Wiener index of a graph. (English) Zbl 1334.05027 Discuss. Math., Graph Theory 36, No. 2, 455-465 (2016). MSC: 05C05 05C12 05C35 PDFBibTeX XMLCite \textit{X. Li} et al., Discuss. Math., Graph Theory 36, No. 2, 455--465 (2016; Zbl 1334.05027) Full Text: DOI
Mao, Yaping; Shi, Yongtang The complexity of determining the vertex-rainbow index of graphs. (English) Zbl 1331.05064 Discrete Math. Algorithms Appl. 7, No. 4, Article ID 1550047, 16 p. (2015). MSC: 05C05 05C15 05C40 68Q25 68R10 PDFBibTeX XMLCite \textit{Y. Mao} and \textit{Y. Shi}, Discrete Math. Algorithms Appl. 7, No. 4, Article ID 1550047, 16 p. (2015; Zbl 1331.05064) Full Text: DOI
Li, Xueliang; Mao, Yaping On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices. (English) Zbl 1328.05046 Graphs Comb. 31, No. 6, 2231-2259 (2015). MSC: 05C05 05C35 05C40 05C70 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. Mao}, Graphs Comb. 31, No. 6, 2231--2259 (2015; Zbl 1328.05046) Full Text: DOI arXiv
Li, Xueliang; Mao, Yaping Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. (English) Zbl 1310.05133 Discrete Appl. Math. 185, 102-112 (2015). MSC: 05C40 05C05 05C70 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. Mao}, Discrete Appl. Math. 185, 102--112 (2015; Zbl 1310.05133) Full Text: DOI arXiv