Lian-Chang Zhao

According to our database, Lian-Chang Zhao authored at least 6 papers between 1983 and 2001.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2001

A necessary and sufficient condition for a graph to be edge tenacious.

Zhi-Ping Wang, Lian-Chang Zhao

Discret. Math., 2001

1998

Combinatorial Analysis of Check Set Construction for Algorithm-Based Fault Tolerance Systems.

De-Qiang Wang, Lian-Chang Zhao

J. Electron. Test., 1998

1997

A new method for proving chromatic uniqueness of graphs.

Ru-Ying Liu, Lian-Chang Zhao

Discret. Math., 1997

1984

Cutpoints and the chromatic polynomial.

Earl Glen Whitehead Jr., Lian-Chang Zhao

J. Graph Theory, 1984

Chromatic uniqueness and equivalence of <i>K</i>₄ homeomorphs.

Earl Glen Whitehead Jr., Lian-Chang Zhao

J. Graph Theory, 1984

1983

A note concerning chromatic polynomials.

Chong-Yun Chao, Lian-Chang Zhao

Discret. Math., 1983