Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices. - Zhangdong Ouyang; Jing Wang; Yuanqiu Huang (Graphs Comb., 2009)

On the lower bounds for the maximum genus for simple graphs. - Zhangdong Ouyang; Jing Wang; Yuanqiu Huang (Eur. J. Comb., 2010)

The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability. - Zhangdong Ouyang; Jing Wang; Yuanqiu Huang (Ars Comb., 2013)

The crossing number of the Cartesian product of paths with complete graphs. - Zhangdong Ouyang; Jing Wang; Yuanqiu Huang (Discret. Math., 2014)

The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth. - Yahui Hu; Yaoping Hou; Zhangdong Ouyang (Ars Comb., 2015)

Total Embedding distributions for two graph families obtained from the dipole D3. - Ting Guo; Yuanqiu Huang; Zhangdong Ouyang (Ars Comb., 2016)

A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks. - Zhimin Liu; Zhangdong Ouyang (KSII Trans. Internet Inf. Syst., 2017)

k -Coverage Estimation Problem in Heterogeneous Camera Sensor Networks With Boundary Deployment. - Zhimin Liu; Zhangdong Ouyang (IEEE Access, 2018)

The crossing numbers of Cartesian products of path with some graphs. - Zongpeng Ding; Yuanqiu Huang; Zhangdong Ouyang (Ars Comb., 2018)

The Strong Product of Graphs and Crossing Numbers. - Zhangdong Ouyang; Jing Wang; Yuanqiu Huang (Ars Comb., 2018)

The crossing number of join of the generalized Petersen graph P(3, 1) with path and cycle. - Yuanqiu Huang; Zhangdong Ouyang; Jing Wang (Discuss. Math. Graph Theory, 2018)

Remarks on the joins of 1-planar graphs. - Zhangdong Ouyang; Jun Ge; Yichao Chen (Appl. Math. Comput., 2019)

On the skewness of Cartesian products with trees. - Zhangdong Ouyang; Fengming Dong; Eng Guan Tay (Discret. Appl. Math., 2019)

The crossing number of the hexagonal graph H3, n. - Yuanqiu Huang; Zhangdong Ouyang; Jing Wang (Discuss. Math. Graph Theory, 2019)

On the Sizes of Bipartite 1-Planar Graphs. - Yuanqiu Huang; Zhangdong Ouyang; Fengming Dong (Electron. J. Comb., 2021)

The Maximal 1-Planarity and Crossing Numbers of Graphs. - Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong (Graphs Comb., 2021)

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations. - Fengming Dong; Jun Ge; Helin Gong; Bo Ning 001; Zhangdong Ouyang; Eng Guan Tay (J. Graph Theory, 2021)

Zip product of graphs and crossing numbers. - Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong; Eng Guan Tay (J. Graph Theory, 2021)

Express the number of spanning trees in term of degrees. - Fengming Dong; Jun Ge; Zhangdong Ouyang (Appl. Math. Comput., 2022)

New upper bounds for the crossing numbers of crossing-critical graphs. - Zongpeng Ding; Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong (Discret. Math., 2022)

On the Size of Matchings in 1-Planar Graph with High Minimum Degree. - Yuanqiu Huang; Zhangdong Ouyang; Fengming Dong (SIAM J. Discret. Math., 2022)

Reliability analysis of godan graphs in terms of generalized 4-connectivity. - Jing Wang 235; Zhangdong Ouyang; Yuanqiu Huang (Discret. Appl. Math., 2025)

The generalized 4-connectivity of burnt pancake graphs. - Jing Wang 235; Jiang Wu; Zhangdong Ouyang; Yuanqiu Huang (Discret. Appl. Math., 2025)