Lifeng Dai

According to our database1, Lifeng Dai authored at least 1 paper in 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2017
Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable.
Discret. Math., 2017


  Loading...