Jianliang Wu

81 papers Misc 3Journal 78
YearRankTypeTitle / Venue / Authors
2024 J jnl
H-sequences and 2-step coreness in graphs.
Discret. Appl. Math.
Jianliang Wu, Xingqin Qi, Zhulou Cao
2024 J jnl
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs.
J. Comb. Optim.
Lin Sun, Guanglong Yu, Jianliang Wu
2022 J jnl
On generalized neighbor sum distinguishing index of planar graphs.
Discret. Math. Algorithms Appl.
Jieru Feng, Yue Wang, Jianliang Wu
2022 J jnl
The total coloring of K5-minor-free graphs.
Eur. J. Comb.
Fan Yang, Jianliang Wu
2021 J jnl
The edge colorings of K5-minor free graphs.
Discret. Math.
Jieru Feng, Yuping Gao, Jianliang Wu
2020 J jnl
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.
Discret. Math.
Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu
2020 J jnl
List-coloring clique-hypergraphs of K5-minor-free graphs strongly.
Discret. Math.
Zuosong Liang, Jianliang Wu, Erfang Shan
2019 J jnl
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9.
Discret. Math.
Jie Hu, Guanghui Wang, Jianliang Wu, Donglei Yang, Xiaowei Yu
2019 J jnl
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles.
Discret. Math. Theor. Comput. Sci.
Aijun Dong, Jianliang Wu
2019 J jnl
Graphs are (1, Δ+1)-choosable.
Discret. Math.
Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu
2019 J jnl
On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7.
Discret. Math.
Yue Wang, Jianliang Wu, Donglei Yang
2018 J jnl
A lower bound of revised Szeged index of bicyclic graphs.
Appl. Math. Comput.
Shengjin Ji, Mengmeng Liu, Jianliang Wu
2018 J jnl
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix.
Future Gener. Comput. Syst.
Min Liu, Zhen Xiong, Yue Ma, Peng Zhang, Jianliang Wu, Xingqin Qi
2018 J jnl
Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles.
Ars Comb.
Aijun Dong, Jianliang Wu
2018 J jnl
Generalized acyclic edge colorings via entropy compression.
J. Comb. Optim.
Laihao Ding, Guanghui Wang, Jianliang Wu
2018 J jnl
List r-hued chromatic number of graphs with bounded maximum average degrees.
Discret. Math.
Huimin Song, Hong-Jian Lai, Jianliang Wu
2018 J jnl
List-edge-coloring of planar graphs without 6-cycles with three chords.
J. Comb. Optim.
Haiying Wang, Jianliang Wu
2018 J jnl
Local antimagic labeling of graphs.
Appl. Math. Comput.
Xiaowei Yu, Jie Hu, Donglei Yang, Jianliang Wu, Guanghui Wang
2018 J jnl
Minimum choosability of planar graphs.
J. Comb. Optim.
Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du, Jianliang Wu
2018 J jnl
Multipolarization versus unification in community networks.
Future Gener. Comput. Syst.
Jingcheng Fu, Jianwen Li, Yawei Niu, Guanghui Wang, Jianliang Wu
2018 J jnl
On splitting digraphs.
Eur. J. Comb.
Donglei Yang, Yandong Bai, Guanghui Wang, Jianliang Wu
2018 J jnl
On the first reformulated Zagreb indices of graphs with a given clique number.
Ars Comb.
Shengjin Ji, Qiuju Bian, Jianfeng Wang, Jianliang Wu
2018 J jnl
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven.
J. Comb. Optim.
Xiaohan Cheng, Jianliang Wu
2018 J jnl
Vertex arboricity of planar graphs without intersecting 5-cycles.
J. Comb. Optim.
Hua Cai, Jianliang Wu, Lin Sun
2017 J jnl
Equitable vertex arboricity of 5-degenerate graphs.
J. Comb. Optim.
Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu
2017 J jnl
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.
Graphs Comb.
Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu
2017 J jnl
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10.
Appl. Math. Comput.
Donglei Yang, Lin Sun, Xiaowei Yu, Jianliang Wu, Shan Zhou
2017 J jnl
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.
J. Comb. Optim.
Xiaohan Cheng, Guanghui Wang, Jianliang Wu
2017 J jnl
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.
J. Comb. Optim.
Lin Sun, Xiaohan Cheng, Jianliang Wu
2016 J jnl
Total coloring of planar graphs without short cycles.
J. Comb. Optim.
Hua Cai, Jianliang Wu, Lin Sun
2015 J jnl
Total Coloring of Planar Graphs Without Chordal Short Cycles.
Graphs Comb.
Huijuan Wang, Bin Liu, Jianliang Wu
2014 J jnl
A note on Edge Weight choosability of graphs.
Discret. Math. Algorithms Appl.
Jingcheng Fu, Guanghui Wang, Jianliang Wu, Jin Xu
2014 J jnl
Minimum number of disjoint linear forests covering a planar graph.
J. Comb. Optim.
Huijuan Wang, Lidong Wu, Weili Wu, Jianliang Wu
2014 J jnl
On the linear arboricity of graphs embeddable in surfaces.
Inf. Process. Lett.
Huijuan Wang, Jianliang Wu, Bin Liu, Hongyu Chen
2014 J jnl
Total coloring of embedded graphs with maximum degree at least seven.
Theor. Comput. Sci.
Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu
2014 J jnl
Total coloring of planar graphs with maximum degree 8.
Theor. Comput. Sci.
Huijuan Wang, Lidong Wu, Jianliang Wu
2013 J jnl
The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords.
Graphs Comb.
Hongyu Chen, Xiang Tan, Jianliang Wu, Guojun Li
2013 J jnl
The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.
Ars Comb.
Lian-Cui Zuo, Bang-Jun Li, Jianliang Wu
2012 J jnl
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.
Discret. Math.
Xin Zhang, Guizhen Liu, Jianliang Wu
2012 J jnl
A conjecture on equitable vertex arboricity of graphs
CoRR
Xin Zhang, Jianliang Wu
2012 J jnl
Acyclic Edge Coloring of Planar Graphs Without Small Cycles.
Graphs Comb.
Jianfeng Hou, Guizhen Liu, Jianliang Wu
2012 J jnl
Edge covering pseudo-outerplanar graphs with forests.
Discret. Math.
Xin Zhang, Guizhen Liu, Jianliang Wu
2012 J jnl
Equitable vertex arboricity of graphs
CoRR
Jianliang Wu, Xin Zhang, Hailun Li
2012 J jnl
Total colorings of planar graphs without intersecting 5-cycles.
Discret. Appl. Math.
Bing Wang, Jianliang Wu
2011 J jnl
(1,λ)-embedded graphs and the acyclic edge choosability
CoRR
Xin Zhang, Guizhen Liu, Jianliang Wu
2011 J jnl
A note on relaxed equitable coloring of graphs.
Inf. Process. Lett.
Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang
2011 J jnl
Acyclic chromatic index of planar graphs with triangles.
Inf. Process. Lett.
Jianfeng Hou, Nicolas Roussel, Jianliang Wu
2011 J jnl
Circular vertex arboricity.
Discret. Appl. Math.
Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu
2011 J jnl
Edge covering pseudo-outerplanar graphs with forests
CoRR
Xin Zhang, Guizhen Liu, Jianliang Wu
2011 J jnl
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree.
Discret. Math. Theor. Comput. Sci.
Xin Zhang, Jianliang Wu, Guizhen Liu
2011 J jnl
On edge colorings of 1-planar graphs.
Inf. Process. Lett.
Xin Zhang, Jianliang Wu
2011 J jnl
On equitable and equitable list colorings of series-parallel graphs.
Discret. Math.
Xin Zhang, Jianliang Wu
2011 J jnl
Total coloring of planar graphs with maximum degree 7.
Inf. Process. Lett.
Bing Wang, Jianliang Wu
2011 J jnl
Total coloring of planar graphs without 6-cycles.
Discret. Appl. Math.
Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu
2011 J jnl
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles.
Discret. Math.
Bing Wang, Jianliang Wu
2011 J jnl
k-forested choosability of graphs with bounded maximum average degree
CoRR
Xin Zhang, Guizhen Liu, Jianliang Wu
2010 J jnl
Acyclic edge chromatic number of outerplanar graphs.
J. Graph Theory
Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu
2010 J jnl
Degree conditions for the partition of a graph into triangles and quadrilaterals
CoRR
Xin Zhang, Jianliang Wu, Jin Yan
2010 J jnl
Edge Coloring of Triangle-Free 1-Planar Graphs
CoRR
Xin Zhang, Guizhen Liu, Jianliang Wu
2010 J jnl
Structural properties of 1-planar graphs and an application to acyclic edge coloring
CoRR
Xin Zhang, Guizhen Liu, Jianliang Wu
2010 J jnl
Vertex-disjoint triangles in K
Discret. Math.
Xin Zhang, Na Li, Jianliang Wu, Jin Yan
2009 J jnl
On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.
Ars Comb.
Jianfeng Hou, Guizhen Liu, Jianliang Wu
2009 J jnl
Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discret. Math.
Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu
2009 J jnl
Total colorings of planar graphs without adjacent triangles.
Discret. Math.
Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou
2009 J jnl
Vertex arboricity of integer distance graph G(D
Discret. Math.
Lian-Cui Zuo, Qinglin Yu, Jianliang Wu
2008 J jnl
Equitable coloring planar graphs with large girth.
Discret. Math.
Jianliang Wu, Ping Wang
2008 J jnl
List-edge and list-total colorings of graphs embedded on hyperbolic surfaces.
Discret. Math.
Jianliang Wu, Ping Wang
2008 J jnl
Total Colorings of Planar Graphs without Small Cycles.
Graphs Comb.
Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan
2007 Misc conf
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs.
International Conference on Computational Science (3)
Jianliang Wu, Ping Wang
2007 Misc conf
Some Results on List Total Colorings of Planar Graphs.
International Conference on Computational Science (3)
Jianfeng Hou, Guizhen Liu, Jianliang Wu
2007 Misc conf
The Equitable Edge-Coloring of Series-Parallel Graphs.
International Conference on Computational Science (3)
Huimin Song, Jianliang Wu, Guizhen Liu
2007 J jnl
The linear arboricity of planar graphs with no short cycles.
Theor. Comput. Sci.
Jianliang Wu, Jianfeng Hou, Guizhen Liu
2006 J jnl
The Fractional Vertex Linear Arboricity of Graphs.
Ars Comb.
Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu
2006 J jnl
The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.
Ars Comb.
Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu
2006 J jnl
The vertex linear arboricity of distance graphs.
Discret. Math.
Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu
2006 J jnl
Tree coloring of distance graphs with a real interval set.
Appl. Math. Lett.
Lian-Cui Zuo, Qinglin Yu, Jianliang Wu
2005 J jnl
Two sufficient conditions for a graph to be type 1.
Ars Comb.
Jianliang Wu, Ping Wang, Anthony J. W. Hilton
2004 J jnl
A note on total colorings of planar graphs without 4-cycles.
Discuss. Math. Graph Theory
Ping Wang, Jianliang Wu
2003 J jnl
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.
Discret. Math.
Lianying Miao, Shiyou Pang, Jianliang Wu
2002 J jnl
Edge-coloring critical graphs with high degree.
Discret. Math.
Lianying Miao, Jianliang Wu
2000 J jnl
The Linear Arboricity of Series-Parallel Graphs.
Graphs Comb.
Jianliang Wu