A note on 3-choosability of planar graphs. - Yingqian Wang 001; Huajing Lu; Ming Chen 015 (Inf. Process. Lett., 2008)

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. - Huajing Lu; Yingqian Wang 001; Weifan Wang 001; Yuehua Bu; Mickaël Montassier; André Raspaud (Discret. Math., 2009)

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. - Yingqian Wang 001; Huajing Lu; Ming Chen 015 (Discret. Math., 2010)

The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l. - Huajing Lu; Xuding Zhu (Discret. Math., 2020)

Dense Eulerian Graphs are $(1, 3)$-Choosable. - Huajing Lu; Xuding Zhu (Electron. J. Comb., 2022)

The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles. - Huajing Lu; Fengwei Li (Axioms, 2023)

Decomposition of planar graphs with forbidden configurations. - Lingxi Li; Huajing Lu; Tao Wang 005; Xuding Zhu (Discret. Appl. Math., 2023)

The greatest values for atom-bond sum-connectivity index of graphs with given parameters. - Fengwei Li; Qingfang Ye; Huajing Lu (Discret. Appl. Math., 2024)