Huajing Lu

According to our database, Huajing Lu authored at least 8 papers between 2008 and 2024.

Collaborative distances:

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

2024

The greatest values for atom-bond sum-connectivity index of graphs with given parameters.

Fengwei Li, Qingfang Ye, Huajing Lu

Discret. Appl. Math., February, 2024

2023

Decomposition of planar graphs with forbidden configurations.

Lingxi Li, Huajing Lu, Tao Wang, Xuding Zhu

Discret. Appl. Math., May, 2023

The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles.

Huajing Lu, Fengwei Li

Axioms, February, 2023

2022

Dense Eulerian Graphs are $(1, 3)$-Choosable.

Huajing Lu, Xuding Zhu

Electron. J. Comb., 2022

2020

The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l.

Huajing Lu, Xuding Zhu

Discret. Math., 2020

2010

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable.

Yingqian Wang, Huajing Lu, Ming Chen

Discret. Math., 2010

2009

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.

Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud

Discret. Math., 2009

2008

A note on 3-choosability of planar graphs.

Yingqian Wang, Huajing Lu, Ming Chen

Inf. Process. Lett., 2008