On the linear arboricity of planar graphs. - Jian-Liang Wu 001 (J. Graph Theory, 1999)

The Linear Arboricity of Series-Parallel Graphs. - Jianliang Wu 001 (Graphs Comb., 2000)

Edge-coloring critical graphs with high degree. - Lianying Miao; Jianliang Wu 001 (Discret. Math., 2002)

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. - Lianying Miao; Shiyou Pang; Jianliang Wu 001 (Discret. Math., 2003)

Total Coloring of Series-Parallel Graphs. - Jian-Liang Wu 001; Daiqiang Hu (Ars Comb., 2004)

Minimum average distance of strong orientations of graphs. - Peter Dankelmann; Ortrud Oellermann; Jian-Liang Wu 001 (Discret. Appl. Math., 2004)

A note on total colorings of planar graphs without 4-cycles. - Ping Wang; Jianliang Wu 001 (Discuss. Math. Graph Theory, 2004)

Two sufficient conditions for a graph to be type 1. - Jianliang Wu 001; Ping Wang; Anthony J. W. Hilton (Ars Comb., 2005)

Tree coloring of distance graphs with a real interval set. - Lian-Cui Zuo; Qinglin Yu; Jianliang Wu 001 (Appl. Math. Lett., 2006)

The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set. - Lian-Cui Zuo; Jianliang Wu 001; Jia-Zhuang Liu (Ars Comb., 2006)

The Fractional Vertex Linear Arboricity of Graphs. - Lian-Cui Zuo; Jianliang Wu 001; Jia-Zhuang Liu (Ars Comb., 2006)

The vertex linear arboricity of distance graphs. - Lian-Cui Zuo; Jianliang Wu 001; Jia-Zhuang Liu (Discret. Math., 2006)

Some Results on List Total Colorings of Planar Graphs. - Jianfeng Hou; Guizhen Liu; Jianliang Wu 001 (International Conference on Computational Science (3), 2007)

The Equitable Edge-Coloring of Series-Parallel Graphs. - Huimin Song; Jianliang Wu 001; Guizhen Liu (International Conference on Computational Science (3), 2007)

A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs. - Jianliang Wu 001; Ping Wang (International Conference on Computational Science (3), 2007)

The linear arboricity of planar graphs with no short cycles. - Jianliang Wu 001; Jianfeng Hou; Guizhen Liu (Theor. Comput. Sci., 2007)

The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree. - Jian-Liang Wu 001; Yu-Liang Wu (Ars Comb., 2008)

Equitable coloring planar graphs with large girth. - Jianliang Wu 001; Ping Wang (Discret. Math., 2008)

List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. - Jianliang Wu 001; Ping Wang (Discret. Math., 2008)

Total Colorings of Planar Graphs without Small Cycles. - Jianfeng Hou; Yan Zhu 008; Guizhen Liu; Jianliang Wu 001; Mei Lan (Graphs Comb., 2008)

The linear arboricity of planar graphs of maximum degree seven is four. - Jian-Liang Wu 001; Yu-Wen Wu (J. Graph Theory, 2008)

The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic. - Jian-Liang Wu 001 (SIAM J. Discret. Math., 2008)

On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability. - Jianfeng Hou; Guizhen Liu; Jianliang Wu 001 (Ars Comb., 2009)

Total colorings and list total colorings of planar graphs without intersecting 4-cycles. - Bin Liu 009; Jianfeng Hou; Jianliang Wu 001; Guizhen Liu (Discret. Math., 2009)

Planar graphs without 5-cycles or without 6-cycles. - Qin Ma 003; Jian-Liang Wu 001; Xiao Yu (Discret. Math., 2009)

Total colorings of planar graphs without adjacent triangles. - Xiang-Yong Sun; Jianliang Wu 001; Yu-Wen Wu; Jianfeng Hou (Discret. Math., 2009)

Vertex arboricity of integer distance graph G(Dm, k). - Lian-Cui Zuo; Qinglin Yu; Jianliang Wu 001 (Discret. Math., 2009)

Structural properties of 1-planar graphs and an application to acyclic edge coloring - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2010)

Degree conditions for the partition of a graph into triangles and quadrilaterals - Xin Zhang 017; Jianliang Wu 001; Jin Yan (CoRR, 2010)

Edge Coloring of Triangle-Free 1-Planar Graphs - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2010)

Vertex-disjoint triangles in K1, t-free graphs with minimum degree at least t. - Xin Zhang 017; Na Li; Jianliang Wu 001; Jin Yan (Discret. Math., 2010)

Acyclic edge chromatic number of outerplanar graphs. - Jianfeng Hou; Jianliang Wu 001; Guizhen Liu; Bin Liu 009 (J. Graph Theory, 2010)

Edge colorings of planar graphs with maximum degree five. - Jian-Liang Wu 001; Yu-Wen Wu (Ars Comb., 2011)

k-forested choosability of graphs with bounded maximum average degree - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2011)

(1,λ)-embedded graphs and the acyclic edge choosability - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (CoRR, 2011)

Total coloring of planar graphs without 6-cycles. - Jianfeng Hou; Bin Liu 009; Guizhen Liu; Jianliang Wu 001 (Discret. Appl. Math., 2011)

Circular vertex arboricity. - Guanghui Wang 002; Shan Zhou; Guizhen Liu; Jianliang Wu 001 (Discret. Appl. Math., 2011)

Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles. - Bing Wang; Jianliang Wu 001 (Discret. Math., 2011)

On equitable and equitable list colorings of series-parallel graphs. - Xin Zhang 017; Jianliang Wu 001 (Discret. Math., 2011)

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. - Xin Zhang 017; Jianliang Wu 001; Guizhen Liu (Discret. Math. Theor. Comput. Sci., 2011)

A note on relaxed equitable coloring of graphs. - Hao Fan; Hal A. Kierstead; Guizhen Liu; Theodore Molla; Jianliang Wu 001; Xin Zhang 017 (Inf. Process. Lett., 2011)

Acyclic chromatic index of planar graphs with triangles. - Jianfeng Hou; Nicolas Roussel; Jianliang Wu 001 (Inf. Process. Lett., 2011)

Total coloring of planar graphs with maximum degree 7. - Bing Wang; Jianliang Wu 001 (Inf. Process. Lett., 2011)

On edge colorings of 1-planar graphs. - Xin Zhang 017; Jianliang Wu 001 (Inf. Process. Lett., 2011)

Equitable vertex arboricity of graphs - Jianliang Wu 001; Xin Zhang 017; Hailun Li (CoRR, 2012)

A conjecture on equitable vertex arboricity of graphs - Xin Zhang 017; Jianliang Wu 001 (CoRR, 2012)

Total colorings of planar graphs without intersecting 5-cycles. - Bing Wang; Jianliang Wu 001 (Discret. Appl. Math., 2012)

A note on the total coloring of planar graphs without adjacent 4-cycles. - Huijuan Wang; Jian-Liang Wu 001 (Discret. Math., 2012)

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs. - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (Discret. Math., 2012)

Edge covering pseudo-outerplanar graphs with forests. - Xin Zhang 017; Guizhen Liu; Jianliang Wu 001 (Discret. Math., 2012)

Acyclic Edge Coloring of Planar Graphs Without Small Cycles. - Jianfeng Hou; Guizhen Liu; Jianliang Wu 001 (Graphs Comb., 2012)

A Planar linear arboricity conjecture. - Marek Cygan; Jianfeng Hou; Lukasz Kowalik; Borut Luzar; Jian-Liang Wu 001 (J. Graph Theory, 2012)

The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs. - Lian-Cui Zuo; Bang-Jun Li; Jianliang Wu 001 (Ars Comb., 2013)

Equitable vertex arboricity of graphs. - Jian-Liang Wu 001; Xin Zhang 017; Hailuan Li (Discret. Math., 2013)

The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords. - Hongyu Chen; Xiang Tan; Jianliang Wu 001; Guojun Li (Graphs Comb., 2013)

Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs". - Jianfeng Hou; Jian-Liang Wu 001 (J. Graph Theory, 2013)

Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. - Jian Chang; Huijuan Wang; Jian-Liang Wu 001; Yong-Ga A (Theor. Comput. Sci., 2013)

Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8. - Jian Chang; Jian-Liang Wu 001; Huijuan Wang; Zhan-Hai Guo (Electron. J. Comb., 2014)

Total colorings of planar graphs without chordal 6-cycles. - Bing Wang; Jian-Liang Wu 001; Huijuan Wang (Discret. Appl. Math., 2014)

A note on Edge Weight choosability of graphs. - Jingcheng Fu; Guanghui Wang 002; Jianliang Wu 001; Jin Xu (Discret. Math. Algorithms Appl., 2014)

On the linear arboricity of graphs embeddable in surfaces. - Huijuan Wang; Jianliang Wu 001; Bin Liu 009; Hongyu Chen (Inf. Process. Lett., 2014)

Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications. - Zhaoyang Luo; Jian-Liang Wu 001 (J. Appl. Math., 2014)

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle. - Yiqiao Wang 002; Qiaojun Shu; Jian-Liang Wu 001; Wenwen Zhang (J. Comb. Optim., 2014)

Minimum number of disjoint linear forests covering a planar graph. - Huijuan Wang; Lidong Wu; Weili Wu 001; Jianliang Wu 001 (J. Comb. Optim., 2014)

Minimum total coloring of planar graph. - Huijuan Wang; Lidong Wu; Weili Wu 001; Panos M. Pardalos; Jian-Liang Wu 001 (J. Glob. Optim., 2014)

Total colorings of planar graphs with sparse triangles. - Jian Chang; Jian-Liang Wu 001; Yong-Ga A (Theor. Comput. Sci., 2014)

Edge coloring of planar graphs which any two short cycles are adjacent at most once. - Wei-Ping Ni; Jian-Liang Wu 001 (Theor. Comput. Sci., 2014)

Total coloring of embedded graphs with maximum degree at least seven. - Huijuan Wang; Bin Liu 009; Jianliang Wu 001; Guizhen Liu (Theor. Comput. Sci., 2014)

Total coloring of planar graphs with maximum degree 8. - Huijuan Wang; Lidong Wu; Jianliang Wu 001 (Theor. Comput. Sci., 2014)

Edge colorings of planar graphs without 5-cycles with two chords. - Jian-Liang Wu 001; Ling Xue (Theor. Comput. Sci., 2014)

Total coloring of planar graphs with 7-cycles containing at most two chords. - Renyu Xu; Jian-Liang Wu 001 (Theor. Comput. Sci., 2014)

Acyclic Total Colorings of Planar Graphs. - Xiang-Yong Sun; Jian-Liang Wu 001 (Ars Comb., 2015)

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. - Xiaohan Cheng; Danjun Huang; Guanghui Wang 002; Jian-Liang Wu 001 (Discret. Appl. Math., 2015)

Total Coloring of Planar Graphs Without Chordal Short Cycles. - Huijuan Wang; Bin Liu 009; Jianliang Wu 001 (Graphs Comb., 2015)

Some sufficient conditions for 1-planar graphs to be Class 1. - Wenwen Zhang; Jian-Liang Wu 001 (Theor. Comput. Sci., 2015)

On r-hued coloring of planar graphs with girth at least 6. - Huimin Song; Hong-Jian Lai; Jian-Liang Wu 001 (Discret. Appl. Math., 2016)

List injective coloring of planar graphs with girth g≥6. - Hongyu Chen; Jian-Liang Wu 001 (Discret. Math., 2016)

A Relaxed Case on 1-2-3 Conjecture. - Yuping Gao; Guanghui Wang 002; Jian-Liang Wu 001 (Graphs Comb., 2016)

Total coloring of planar graphs without short cycles. - Hua Cai; Jianliang Wu 001; Lin Sun (J. Comb. Optim., 2016)

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic. - Renyu Xu; Jian-Liang Wu 001; Jin Xu (J. Comb. Optim., 2016)

On the neighbor sum distinguishing total coloring of planar graphs. - Cunquan Qu; Guanghui Wang 002; Jian-Liang Wu 001; Xiaowei Yu (Theor. Comput. Sci., 2016)

Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. - Donglei Yang; Lin Sun; Xiaowei Yu; Jianliang Wu 001; Shan Zhou (Appl. Math. Comput., 2017)

A sufficient condition for a planar graph to be 4-choosable. - Renyu Xu; Jian-Liang Wu 001 (Discret. Appl. Math., 2017)

Planar graphs without intersecting 5-cycles are 4-choosable. - Daiqiang Hu; Jian-Liang Wu 001 (Discret. Math., 2017)

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. - Laihao Ding; Guanghui Wang 002; Jianliang Wu 001; Jiguo Yu (Graphs Comb., 2017)

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. - Daiqiang Hu; Jian-Liang Wu 001; Donglei Yang; Xin Zhang 017 (Graphs Comb., 2017)

Equitable vertex arboricity of 5-degenerate graphs. - Guantao Chen; Yuping Gao; Songling Shan; Guanghui Wang 002; Jianliang Wu 001 (J. Comb. Optim., 2017)

The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10. - Xiaohan Cheng; Guanghui Wang 002; Jianliang Wu 001 (J. Comb. Optim., 2017)

The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. - Lin Sun; Xiaohan Cheng; Jianliang Wu 001 (J. Comb. Optim., 2017)

On (p, 1)-total labelling of planar graphs. - Lin Sun; Jian-Liang Wu 001 (J. Comb. Optim., 2017)

A lower bound of revised Szeged index of bicyclic graphs. - Shengjin Ji; Mengmeng Liu; Jianliang Wu 001 (Appl. Math. Comput., 2018)

Local antimagic labeling of graphs. - Xiaowei Yu; Jie Hu; Donglei Yang; Jianliang Wu 001; Guanghui Wang 002 (Appl. Math. Comput., 2018)

Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles. - Aijun Dong; Jianliang Wu 001 (Ars Comb., 2018)

On the first reformulated Zagreb indices of graphs with a given clique number. - Shengjin Ji; Qiuju Bian; Jianfeng Wang; Jianliang Wu 001 (Ars Comb., 2018)

A note on the edge colorings of planar graphs without 7-cycles with three chords. - Wenwen Zhang; Jian-Liang Wu 001 (Ars Comb., 2018)

Planar graphs without chordal 6-cycles are 4-choosable. - Daiqiang Hu; Danjun Huang; Weifan Wang 001; Jian-Liang Wu 001 (Discret. Appl. Math., 2018)

List r-hued chromatic number of graphs with bounded maximum average degrees. - Huimin Song; Hong-Jian Lai; Jianliang Wu 001 (Discret. Math., 2018)

Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles. - Lin Sun; Bing Wang; Jian-Liang Wu 001 (Discuss. Math. Graph Theory, 2018)

On splitting digraphs. - Donglei Yang; Yandong Bai; Guanghui Wang 002; Jianliang Wu 001 (Eur. J. Comb., 2018)

Multipolarization versus unification in community networks. - Jingcheng Fu; Jianwen Li; Yawei Niu; Guanghui Wang 002; Jianliang Wu 001 (Future Gener. Comput. Syst., 2018)

DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix. - Min Liu; Zhen Xiong; Yue Ma; Peng Zhang; Jianliang Wu 001; Xingqin Qi (Future Gener. Comput. Syst., 2018)

Vertex arboricity of planar graphs without intersecting 5-cycles. - Hua Cai; Jianliang Wu 001; Lin Sun (J. Comb. Optim., 2018)

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. - Xiaohan Cheng; Jianliang Wu 001 (J. Comb. Optim., 2018)

Generalized acyclic edge colorings via entropy compression. - Laihao Ding; Guanghui Wang 002; Jianliang Wu 001 (J. Comb. Optim., 2018)

Minimum choosability of planar graphs. - Huijuan Wang; Bin Liu 009; Ling Gai; Hongwei Du 001; Jianliang Wu 001 (J. Comb. Optim., 2018)

List-edge-coloring of planar graphs without 6-cycles with three chords. - Haiying Wang 002; Jianliang Wu 001 (J. Comb. Optim., 2018)

Edge coloring of planar graphs without adjacent 7-cycles. - Wenwen Zhang; Jian-Liang Wu 001 (Theor. Comput. Sci., 2018)

Graphs are (1, Δ+1)-choosable. - Laihao Ding; Guan-Huei Duh; Guanghui Wang 002; Tsai-Lien Wong; Jianliang Wu 001; Xiaowei Yu; Xuding Zhu (Discret. Math., 2019)

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. - Jie Hu; Guanghui Wang 002; Jianliang Wu 001; Donglei Yang; Xiaowei Yu (Discret. Math., 2019)

On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. - Yue Wang 050; Jianliang Wu 001; Donglei Yang (Discret. Math., 2019)

On edge colorings of 1-planar graphs without 5-cycles with two chords. - Lin Sun; Jian-Liang Wu 001 (Discuss. Math. Graph Theory, 2019)

Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles. - Aijun Dong; Jianliang Wu 001 (Discret. Math. Theor. Comput. Sci., 2019)

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. - Xiaohan Cheng; Laihao Ding; Guanghui Wang 002; Jianliang Wu 001 (Discret. Math., 2020)

List-coloring clique-hypergraphs of K5-minor-free graphs strongly. - Zuosong Liang; Jianliang Wu 001; Erfang Shan (Discret. Math., 2020)

The list coloring and list total coloring of planar graphs with maximum degree at least 7. - Bin Liu 009; Lin Sun; Bing Wang; Jian-Liang Wu 001 (Discuss. Math. Graph Theory, 2020)

Toward Structural Controllability and Predictability in Directed Networks. - Fei Jing; Chuang Liu 001; Yi-Cheng Zhang; Jian-Liang Wu 001; Zi-Ke Zhang (CoRR, 2021)

The edge colorings of K5-minor free graphs. - Jieru Feng; Yuping Gao; Jianliang Wu 001 (Discret. Math., 2021)

List edge coloring of planar graphs without 6-cycles with two chords. - Linna Hu; Lei Sun; Jian-Liang Wu 001 (Discuss. Math. Graph Theory, 2021)

The linear arboricity of K5-minor free graphs. - Fan Yang 085; Jian-Liang Wu 001; Huimin Song (Discret. Appl. Math., 2022)

On generalized neighbor sum distinguishing index of planar graphs. - Jieru Feng; Yue Wang 050; Jianliang Wu 001 (Discret. Math. Algorithms Appl., 2022)

The total coloring of K5-minor-free graphs. - Fan Yang 085; Jianliang Wu 001 (Eur. J. Comb., 2022)

Toward Structural Controllability and Predictability in Directed Networks. - Fei Jing; Chuang Liu 001; Jian-Liang Wu 001; Zi-Ke Zhang (IEEE Trans. Syst. Man Cybern. Syst., 2022)

4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. - Fan Yang 085; Yue Wang 050; Jian-Liang Wu 001 (Discret. Math., 2023)

The linear arboricity of graphs with low treewidth. - Xiang Tan; Jian-Liang Wu 001 (Discuss. Math. Graph Theory, 2024)

H-sequences and 2-step coreness in graphs. - Jianliang Wu 001; Xingqin Qi; Zhulou Cao (Discret. Appl. Math., 2024)

On list (p, 1)-total labellings of special planar graphs and 1-planar graphs. - Lin Sun; Guanglong Yu; Jianliang Wu 001 (J. Comb. Optim., 2024)

The Generation and Regulation of Public Opinion on Multiplex Social Networks. - Zhong Zhang; Jian-Liang Wu 001; Cun-Quan Qu; Fei Jing (IEEE Trans. Comput. Soc. Syst., 2024)

A Graphical Approach for Robust Set Stabilization of Boolean Control Networks With Lowest Time Complexity. - Yakun Li; Shuhua Gao; Jun-e Feng; Jian-Liang Wu 001 (IEEE Trans. Netw. Sci. Eng., 2025)