Huajing Lu

most citedDecomposition of planar graphs with forbidden configurations

8 citations · 8 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2021★ 8 cited

Decomposition of planar graphs with forbidden configurations

Lingxi Li, Huajing Lu, Tao Wang +1

A $(d, h)$ -decomposition of a graph $G$ is an ordered pair $(D, H)$ such that $H$ is a subgraph of $G$ of maximum degree at most $h$ and $D$ is an acyclic orientation of $G - E (H)$ wi…

math.CO2021

Dense Eulerian graphs are $(1, 3)$ -choosable

Huajing Lu, Xuding Zhu

A graph $G$ is total weight $(k, k^{'})$ -choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L (v)$ of $k$ real numbers, and each edge $e$ a set $L(e)…

math.CO2019

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

Huajing Lu, Xuding Zhu

This paper proves that if $G$ is a planar graph without 4-cycles and $l$ -cycles for some $l \in {5, 6, 7}$ , then there exists a matching $M$ such that $A T (G - M) \leq 3$ . This implies…

Decomposition of planar graphs with forbidden configurations

Dense Eulerian graphs are (1,3)-choosable

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

Dense Eulerian graphs are $(1, 3)$ -choosable

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