Edge choosability of planar graphs without small cycles. - Li Zhang 009; Baoyindureng Wu (Discret. Math., 2004)

The transformation graph Gxyz when xyz=-++. - Baoyindureng Wu; Li Zhang 009; Zhao Zhang 002 (Discret. Math., 2005)

A note on 3-choosability of planar graphs without certain cycles. - Li Zhang 009; Baoyindureng Wu (Discret. Math., 2005)

Extension of a list coloring problem. - Baoyindureng Wu; Li Zhang 009 (Appl. Math. Lett., 2006)

A note on the cover degeneracy of graphs. - Li Zhang 009; Baoyindureng Wu (J. Graph Theory, 2006)

Disproof of a Conjecture on List Coloring. - Baoyindureng Wu; Li Zhang 009 (Ars Comb., 2008)

The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11. - Baoyindureng Wu; Li Zhang 009 (Discret. Math., 2008)

CCE&D: A Configuration Failure Prevention Method for Autonomous Driving Systems. - Yanqiu Zhang; Xiao Yu; Jinzhao Liu; Li Zhang 009; Yuanzhang Li 001; Yuan Tan (ACISP (3), 2024)