Zengmin Song

According to our database, Zengmin Song authored at least 7 papers between 2001 and 2012.

Collaborative distances:

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

2012

Distance two labelings of Cartesian products of complete graphs.

Damei Lu, Wensong Lin, Zengmin Song

Ars Comb., 2012

2005

Circular chromatic numbers of some distance graphs.

Wensong Lin, Peter Che Bor Lam, Zengmin Song

Discret. Math., 2005

The 3-choosability of plane graphs of girth 4.

Peter Che Bor Lam, Wai Chee Shiu, Zengmin Song

Discret. Math., 2005

2003

Circular chromatic number and a generalization of the construction of Mycielski.

Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song

J. Comb. Theory, Ser. B, 2003

2002

Edge-pancyclicity of coupled graphs.

Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang

Discret. Appl. Math., 2002

2001

Neighborhood Union Condition with Distance for Vertex-pancyclicity.

Wensong Lin, Zengmin Song

Ars Comb., 2001

A note on list improper coloring planar graphs.

Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang

Appl. Math. Lett., 2001