The Crossing Number of Cartesian Products of Complete Bipartite Graphs K 2, m with Paths P n . - Ling Tang; Shengxiang Lv; Yuanqiu Huang (Graphs Comb., 2007)

Up-embeddability of graphs with small order. - Shengxiang Lv; Yanpei Liu (Appl. Math. Lett., 2010)

A new bound on maximum genus of simple graphs. - Shengxiang Lv; Yanpei Liu (Ars Comb., 2011)

Up-embeddability and independent number of simple graphs. - Shengxiang Lv; Yanpei Liu (Ars Comb., 2011)

The Largest Demigenus Over All Signatures on K 3, n. - Shengxiang Lv (Graphs Comb., 2015)

The smallest surface that contains all signed graphs on K4,n. - Shengxiang Lv; Zihan Yuan (Discret. Math., 2018)

Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n. - Shengxiang Lv; Yichao Chen (Discret. Math., 2019)

Mechanism Linking AR-Based Presentation Mode and Consumers' Responses: A Moderated Serial Mediation Model. - Xi Han; Feng Wang; Shengxiang Lv; Wenting Han (J. Theor. Appl. Electron. Commer. Res., 2021)

The crossing number of hexagonal graph H3, n in the projective plane. - Jing Wang; Junliang Cai; Shengxiang Lv; Yuanqiu Huang (Discuss. Math. Graph Theory, 2022)