Lingji Xu

Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable

Lingji Xu, Zhengke Miao, Yingqian Wang · Journal of Combinatorial Optimization · 2013 · 44 citations

Topological Graph Theory, Planar Graph, Graph Theory

Improper Choosability of Planar Graphs without 4-Cycles

Yingqian Wang, Lingji Xu · SIAM Journal on Discrete Mathematics · 2013 · 24 citations

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +7

Improper colorability of planar graphs with cycles of length neither 4 nor 6

Yingqian Wang, Lingji Xu · Scientia Sinica Mathematica · 2013 · 22 citations

Subsets V 1, Graph Minor, Geometric Graph Theory +9

A sufficient condition for a plane graph with maximum degree 6 to be class 1

Yingqian Wang, Lingji Xu · Discrete Applied Mathematics · 2012 · 13 citations

Graph Minor, Geometric Graph Theory, Graph Theory +7