Qiuli Lu

According to our database, Qiuli Lu authored at least 2 papers between 2011 and 2013.

Collaborative distances:

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

2013

Sufficient conditions for a planar graph to be list edge <i>Δ</i>-colorable and list totally (<i>Δ</i>+1)-colorable.

Qiuli Lu, Zhengke Miao, Yingqian Wang

Discret. Math., 2013

2011

(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle.

Qian Wu, Qiuli Lu, Yingqian Wang

Inf. Process. Lett., 2011