On the chromaticity of K4 homeomorphs. - Haizhen Ren (Discret. Math., 2002)

sigma-polynomials. - Haicheng Ma; Haizhen Ren (Discret. Math., 2004)

Extremal double hexagonal chains with respect to k-matchings and k-independent sets. - Haizhen Ren; Fuji Zhang (Discret. Appl. Math., 2007)

The new methods for constructing matching-equivalence graphs. - Haicheng Ma; Haizhen Ren (Discret. Math., 2007)

The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4. - Haicheng Ma; Haizhen Ren (Discret. Math., 2008)

On Orderings of Some Graphs by the Extreme Roots of their Graph Polynomials. - Haizhen Ren (CIS (1), 2009)

On the spectral characterization of the union of complete multipartite graph and some isolated vertices. - Haicheng Ma; Haizhen Ren (Discret. Math., 2010)

Fractional Matching Preclusion for Folded Petersen Cube Networks. - Jinyu Zou; Chengfu Ye; Haizhen Ren (J. Interconnect. Networks, 2020)

The ρ–moments of vertex-weighted graphs. - Caibing Chang; Haizhen Ren; Zijian Deng; Bo Deng (Appl. Math. Comput., 2021)