Jian-Liang Wu

activity

20092026

most citedA Planar Linear Arboricity Conjecture

25 citations · 45 across the 17 of their papers we have counts for

collaborators

Showing math.COShow all

15 papers · 1 filter

math.CO2026

The maximum number of two 4-vertex graphs in planar graphs

Wei Liu, Lin Sun, Jianliang Wu

Let $f (n, H)$ be the maximum number of copies of a graph $H$ in a planar graph of order $n$ . When $H$ is a connected graph on four vertices, $f (n, H)$ has been completely determined…

math.CO2022

$4$ -choosability of planar graphs with $4$ -cycles far apart via the Combinatorial Nullstellensatz

Fan Yang, Yue Wang, Jian-liang Wu

By a well-known theorem of Thomassen and a planar graph depicted by Voigt, we know that every planar graph is $5$ -choosable, and the bound is tight. In 1999, Lam, Xu and Liu reduce…

math.CO2022★ 1 cited

A note on the edge choosability of $K_{5}$ -minor free graphs

Jieru Feng, Jianliang Wu, Fan Yang

For a planar graph $G$ , Borodin stated that $G$ is $(Δ + 1)$ -edge-choosable if $Δ \geq 9$ and later Bonamy showed that $G$ is $9$ -edge-choosable if $Δ = 8$ . At the same time, Borodin et…

math.CO2021

The total coloring of $K_{5}$ -minor-free graphs

Fan Yang, Jianliang Wu

A total $k$ -coloring of a graph $G$ is a coloring of $V (G) \cup E (G)$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic num…

math.CO2020★ 1 cited

The edge colorings of $K_{5}$ -minor free graphs

Jieru Feng, Yuping Gao, Jianliang Wu

In 1965, Vizing proved that every planar graph $G$ with maximum degree $Δ \geq 8$ is edge $Δ$ -colorable. It is also proved that every planar graph $G$ with maximum degree $Δ = 7$ is e…

math.CO2018★ 3 cited

Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

Aijun Dong, Jianliang Wu

A graph $G$ is equitably $k$ -choosable if, for any given $k$ -uniform list assignment $L$ , $G$ is $L$ -colorable and each color appears on at most $⌈ \frac{∣ V ( G ) ∣}{k} ⌉$ vert…

The maximum number of two 4-vertex graphs in planar graphs

4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz

A note on the edge choosability of K5​-minor free graphs

The total coloring of K5​-minor-free graphs

The edge colorings of K5​-minor free graphs

Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

$4$ -choosability of planar graphs with $4$ -cycles far apart via the Combinatorial Nullstellensatz

A note on the edge choosability of $K_{5}$ -minor free graphs

The total coloring of $K_{5}$ -minor-free graphs

The edge colorings of $K_{5}$ -minor free graphs