Li Zhang

The transformation graph Gxyz when xyz=-++

Baoyindureng Wu, Li Zhang, Zhao Zhang, 2005, Discret. Math..

The minimum number of vertices for a triangle-free graph with chil(G)=4 is 11

Li Zhang, Baoyindureng Wu, B. Wu, 2008, Discret. Math..

Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Complete Graph and Wheel

Mu-chun Li, Li Zhang, 2013 .

A note on 3-choosability of planar graphs without certain cycles

Li Zhang, Baoyindureng Wu, B. Wu, 2005, Discret. Math..

Edge DP-coloring in planar graphs

Shenggui Zhang, Li Zhang, You Lu, 2021, Discret. Math..

Edge choosability of planar graphs without small cycles

Li Zhang, Baoyindureng Wu, B. Wu, 2004, Discret. Math..

Edge coloring of signed graphs

Shenggui Zhang, Rong Luo, Dong Ye, 2020, Discret. Appl. Math..