Jian-Liang Wu

Jian-Liang Wu

Shandong University

H-index: 24

Asia-China

About Jian-Liang Wu

Jian-Liang Wu, With an exceptional h-index of 24 and a recent h-index of 13 (since 2020), a distinguished researcher at Shandong University, specializes in the field of Graph Theory, Complex networks.

His recent articles reflect a diverse array of research interests and contributions to the field:

On list (p, 1)-total labellings of special planar graphs and 1-planar graphs

H-sequences and 2-step coreness in graphs

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

Toward structural controllability and predictability in directed networks

A note on the edge choosability of -minor free graphs

The linear arboricity of graphs with low treewidth

On generalized neighbor sum distinguishing index of planar graphs

The total coloring of K5-minor-free graphs

Jian-Liang Wu Information

University

Position

Professor of Mathematics

Citations(all)

2152

Citations(since 2020)

880

Cited By

1715

hIndex(all)

24

hIndex(since 2020)

13

i10Index(all)

70

i10Index(since 2020)

25

Email

University Profile Page

Shandong University

Google Scholar

View Google Scholar Profile

Jian-Liang Wu Skills & Research Interests

Graph Theory

Complex networks

Top articles of Jian-Liang Wu

Title

Journal

Author(s)

Publication Date

On list (p, 1)-total labellings of special planar graphs and 1-planar graphs

Journal of Combinatorial Optimization

Lin Sun

Guanglong Yu

Jianliang Wu

2024/4

H-sequences and 2-step coreness in graphs

Discrete Applied Mathematics

Jianliang Wu

Xingqin Qi

Zhulou Cao

2024/1/30

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

Discrete Mathematics

Fan Yang

Yue Wang

Jian-Liang Wu

2023/4/1

Toward structural controllability and predictability in directed networks

IEEE Transactions on Systems, Man, and Cybernetics: Systems

Fei Jing

Chuang Liu

Jian-Liang Wu

Zi-Ke Zhang

2022/4/4

A note on the edge choosability of -minor free graphs

arXiv preprint arXiv:2208.11263

Jieru Feng

Jianliang Wu

Fan Yang

2022/8/24

The linear arboricity of graphs with low treewidth

Discussiones Mathematicae Graph Theory

Xiang Tan

Jian-Liang Wu

2022/5/27

On generalized neighbor sum distinguishing index of planar graphs

Discrete Mathematics, Algorithms and Applications

Jieru Feng

Yue Wang

Jianliang Wu

2022/5/9

The total coloring of K5-minor-free graphs

European Journal of Combinatorics

Fan Yang

Jianliang Wu

2022/5/1

The edge colorings of K5-minor free graphs

Discrete Mathematics

Jieru Feng

Yuping Gao

Jianliang Wu

2021/6/1

List edge coloring of planar graphs without 6-cycles with two chords

Discussiones Mathematicae Graph Theory

Linna Hu

Lei Sun

Jian-Liang Wu

2021/1/1

The list edge coloring and list total coloring of planar graphs with maximum degree at least 7

Discussiones Mathematicae Graph Theory

Lin Sun

Jianliang Wu

Bing Wang

Bin Liu

2020/1/1

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs

Discrete Mathematics

Xiaohan Cheng

Laihao Ding

Guanghui Wang

Jianliang Wu

2020/7/1

On r-hued coloring of graphs with maximum average degree less than 3

Ars Combinatoria

Huimin Song

H-J Lai

Jianliang Wu

2020/3/5

See List of Professors in Jian-Liang Wu University(Shandong University)