Jian-Liang Wu

49 papers Journal 49
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Graphical Approach for Robust Set Stabilization of Boolean Control Networks With Lowest Time Complexity.
IEEE Trans. Netw. Sci. Eng.
Yakun Li, Shuhua Gao, Jun-e Feng, Jian-Liang Wu
2025 J jnl
Robust Controllability of Boolean Control Networks via Dynamic Programming.
IEEE Trans. Neural Networks Learn. Syst.
Yakun Li, Shuhua Gao, Yiming Gao, Jian-Liang Wu, Jun-e Feng, Cheng Xiang
2024 J jnl
The Generation and Regulation of Public Opinion on Multiplex Social Networks.
IEEE Trans. Comput. Soc. Syst.
Zhong Zhang, Jian-Liang Wu, Cun-Quan Qu, Fei Jing
2024 J jnl
The linear arboricity of graphs with low treewidth.
Discuss. Math. Graph Theory
Xiang Tan, Jian-Liang Wu
2023 J jnl
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz.
Discret. Math.
Fan Yang, Yue Wang, Jian-Liang Wu
2022 J jnl
The linear arboricity of K5-minor free graphs.
Discret. Appl. Math.
Fan Yang, Jian-Liang Wu, Huimin Song
2022 J jnl
Toward Structural Controllability and Predictability in Directed Networks.
IEEE Trans. Syst. Man Cybern. Syst.
Fei Jing, Chuang Liu, Jian-Liang Wu, Zi-Ke Zhang
2021 J jnl
List edge coloring of planar graphs without 6-cycles with two chords.
Discuss. Math. Graph Theory
Linna Hu, Lei Sun, Jian-Liang Wu
2021 J jnl
Toward Structural Controllability and Predictability in Directed Networks.
CoRR
Fei Jing, Chuang Liu, Yi-Cheng Zhang, Jian-Liang Wu, Zi-Ke Zhang
2020 J jnl
The list coloring and list total coloring of planar graphs with maximum degree at least 7.
Discuss. Math. Graph Theory
Bin Liu, Lin Sun, Bing Wang, Jian-Liang Wu
2019 J jnl
On edge colorings of 1-planar graphs without 5-cycles with two chords.
Discuss. Math. Graph Theory
Lin Sun, Jian-Liang Wu
2018 J jnl
A note on the edge colorings of planar graphs without 7-cycles with three chords.
Ars Comb.
Wenwen Zhang, Jian-Liang Wu
2018 J jnl
Edge coloring of planar graphs without adjacent 7-cycles.
Theor. Comput. Sci.
Wenwen Zhang, Jian-Liang Wu
2018 J jnl
Planar graphs without chordal 6-cycles are 4-choosable.
Discret. Appl. Math.
Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu
2018 J jnl
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles.
Discuss. Math. Graph Theory
Lin Sun, Bing Wang, Jian-Liang Wu
2017 J jnl
A sufficient condition for a planar graph to be 4-choosable.
Discret. Appl. Math.
Renyu Xu, Jian-Liang Wu
2017 J jnl
On (p, 1)-total labelling of planar graphs.
J. Comb. Optim.
Lin Sun, Jian-Liang Wu
2017 J jnl
On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs.
Graphs Comb.
Daiqiang Hu, Jian-Liang Wu, Donglei Yang, Xin Zhang
2017 J jnl
Planar graphs without intersecting 5-cycles are 4-choosable.
Discret. Math.
Daiqiang Hu, Jian-Liang Wu
2016 J jnl
A Relaxed Case on 1-2-3 Conjecture.
Graphs Comb.
Yuping Gao, Guanghui Wang, Jian-Liang Wu
2016 J jnl
List injective coloring of planar graphs with girth g≥6.
Discret. Math.
Hongyu Chen, Jian-Liang Wu
2016 J jnl
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic.
J. Comb. Optim.
Renyu Xu, Jian-Liang Wu, Jin Xu
2016 J jnl
On r-hued coloring of planar graphs with girth at least 6.
Discret. Appl. Math.
Huimin Song, Hong-Jian Lai, Jian-Liang Wu
2016 J jnl
On the neighbor sum distinguishing total coloring of planar graphs.
Theor. Comput. Sci.
Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Xiaowei Yu
2015 J jnl
Acyclic Total Colorings of Planar Graphs.
Ars Comb.
Xiang-Yong Sun, Jian-Liang Wu
2015 J jnl
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.
Discret. Appl. Math.
Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu
2015 J jnl
Some sufficient conditions for 1-planar graphs to be Class 1.
Theor. Comput. Sci.
Wenwen Zhang, Jian-Liang Wu
2014 J jnl
Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle.
J. Comb. Optim.
Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu, Wenwen Zhang
2014 J jnl
Edge coloring of planar graphs which any two short cycles are adjacent at most once.
Theor. Comput. Sci.
Wei-Ping Ni, Jian-Liang Wu
2014 J jnl
Edge colorings of planar graphs without 5-cycles with two chords.
Theor. Comput. Sci.
Jian-Liang Wu, Ling Xue
2014 J jnl
Minimum total coloring of planar graph.
J. Glob. Optim.
Huijuan Wang, Lidong Wu, Weili Wu, Panos M. Pardalos, Jian-Liang Wu
2014 J jnl
Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8.
Electron. J. Comb.
Jian Chang, Jian-Liang Wu, Huijuan Wang, Zhan-Hai Guo
2014 J jnl
Total coloring of planar graphs with 7-cycles containing at most two chords.
Theor. Comput. Sci.
Renyu Xu, Jian-Liang Wu
2014 J jnl
Total colorings of planar graphs with sparse triangles.
Theor. Comput. Sci.
Jian Chang, Jian-Liang Wu, Yong-Ga A
2014 J jnl
Total colorings of planar graphs without chordal 6-cycles.
Discret. Appl. Math.
Bing Wang, Jian-Liang Wu, Huijuan Wang
2014 J jnl
Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications.
J. Appl. Math.
Zhaoyang Luo, Jian-Liang Wu
2013 J jnl
Equitable vertex arboricity of graphs.
Discret. Math.
Jian-Liang Wu, Xin Zhang, Hailuan Li
2013 J jnl
Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs".
J. Graph Theory
Jianfeng Hou, Jian-Liang Wu
2013 J jnl
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords.
Theor. Comput. Sci.
Jian Chang, Huijuan Wang, Jian-Liang Wu, Yong-Ga A
2012 J jnl
A Planar linear arboricity conjecture.
J. Graph Theory
Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu
2012 J jnl
A note on the total coloring of planar graphs without adjacent 4-cycles.
Discret. Math.
Huijuan Wang, Jian-Liang Wu
2011 J jnl
Edge colorings of planar graphs with maximum degree five.
Ars Comb.
Jian-Liang Wu, Yu-Wen Wu
2009 J jnl
Planar graphs without 5-cycles or without 6-cycles.
Discret. Math.
Qin Ma, Jian-Liang Wu, Xiao Yu
2008 J jnl
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic.
SIAM J. Discret. Math.
Jian-Liang Wu
2008 J jnl
The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.
Ars Comb.
Jian-Liang Wu, Yu-Liang Wu
2008 J jnl
The linear arboricity of planar graphs of maximum degree seven is four.
J. Graph Theory
Jian-Liang Wu, Yu-Wen Wu
2004 J jnl
Minimum average distance of strong orientations of graphs.
Discret. Appl. Math.
Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
2004 J jnl
Total Coloring of Series-Parallel Graphs.
Ars Comb.
Jian-Liang Wu, Daiqiang Hu
1999 J jnl
On the linear arboricity of planar graphs.
J. Graph Theory
Jian-Liang Wu