Nianfeng Lin

According to our database, Nianfeng Lin authored at least 3 papers between 2013 and 2018.

Collaborative distances:

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

2018

L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph.

Nianfeng Lin, Damei Lü, Jinhua Wang

Int. J. Found. Comput. Sci., 2018

2015

Nordhaus-Gaddum-type results for path covering and L(2, 1)-labeling numbers.

Damei Lü, Juan Du, Nianfeng Lin, Ke Zhang, Dan Yi

J. Comb. Optim., 2015

2013

L(d, 1)-labelings of the edge-path-replacement of a graph.

Damei Lü, Nianfeng Lin

J. Comb. Optim., 2013