| |
| 2001 | ||
|---|---|---|
| 4 | EE | Zhi-Ping Wang, Lian-Chang Zhao: A necessary and sufficient condition for a graph to be edge tenacious. Discrete Mathematics 234(1-3): 191-197 (2001) |
| 1998 | ||
| 3 | EE | De-Qiang Wang, Lian-Chang Zhao: Combinatorial Analysis of Check Set Construction for Algorithm-Based Fault Tolerance Systems. J. Electronic Testing 12(3): 255-260 (1998) |
| 1997 | ||
| 2 | EE | Ru-Ying Liu, Lian-Chang Zhao: A new method for proving chromatic uniqueness of graphs. Discrete Mathematics 171(1-3): 169-177 (1997) |
| 1983 | ||
| 1 | EE | Chong-Yun Chao, Lian-Chang Zhao: A note concerning chromatic polynomials. Discrete Mathematics 45(1): 127-128 (1983) |
| 1 | Chong-Yun Chao | [1] |
| 2 | Ru-Ying Liu | [2] |
| 3 | De-Qiang Wang | [3] |
| 4 | Zhi-Ping Wang | [4] |