Chong-Yun Chao

According to our database, Chong-Yun Chao authored at least 13 papers between 1974 and 1998.

Collaborative distances:

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

1998

On uniquely 3-colorable graphs II.

Chong-Yun Chao, Zhibo Chen

Discret. Math., 1998

1997

On q-graphs.

Chong-Yun Chao, Zhi-Yi Guo, Nian-Zu Li

Discret. Math., 1997

A critically chromatic graph.

Chong-Yun Chao

Discret. Math., 1997

1993

On uniquely 3-colorable graphs.

Chong-Yun Chao, Zhibo Chen

Discret. Math., 1993

1988

On Multinomial Coefficients Modulo a Prime.

Chong-Yun Chao, Mou-Cheng Zhang

Eur. J. Comb., 1988

1986

On <i>q</i>-trees.

Chong-Yun Chao, Nian-Zu Li, Shao-Ji Xu

J. Graph Theory, 1986

1983

A note concerning chromatic polynomials.

Chong-Yun Chao, Lian-Chang Zhao

Discret. Math., 1983

On labeled vertex-transitive digraphs with a prime number of vertices.

Chong-Yun Chao, Jacqueline G. Wells

Discret. Math., 1983

1982

A class of vertex-transitive digraphs, II.

Chong-Yun Chao, Jacqueline G. Wells

J. Comb. Theory B, 1982

On maximally saturated graphs.

Chong-Yun Chao, George A. Novacky

Discret. Math., 1982

1979

Chromatically unique graphs.

Chong-Yun Chao, Earl Glen Whitehead Jr.

Discret. Math., 1979

1974

A Test for Conjugacy of Partitions of Finite Sets.

Chong-Yun Chao

J. Comb. Theory A, 1974

A note on labeled symmetric graphs.

Chong-Yun Chao

Discret. Math., 1974