default search action
Jian-Liang Wu
Jianliang Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j121]Jianliang Wu, Xingqin Qi, Zhulou Cao
:
H-sequences and 2-step coreness in graphs. Discret. Appl. Math. 343: 258-268 (2024) - [j120]Xiang Tan, Jian-Liang Wu:
The linear arboricity of graphs with low treewidth. Discuss. Math. Graph Theory 44(2): 475 (2024) - [j119]Lin Sun
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs. J. Comb. Optim. 47(3): 15 (2024) - [j118]Zhong Zhang
The Generation and Regulation of Public Opinion on Multiplex Social Networks. IEEE Trans. Comput. Soc. Syst. 11(5): 6513-6527 (2024) - [c15]Zidong Zhang, Jianqi Du, Wenrui Diao, Jianliang Wu:
MiniBLE: Exploring Insecure BLE API Usages in Mini-Programs. SaTS@CCS 2024: 18-22 - [c14]Jianliang Wu
SoK: The Long Journey of Exploiting and Defending the Legacy of King Harald Bluetooth. SP 2024: 2847-228066 - [c13]Jianliang Wu, Patrick Traynor, Dongyan Xu, Dave (Jing) Tian, Antonio Bianchi:
Finding Traceability Attacks in the Bluetooth Low Energy Specification and Its Implementations. USENIX Security Symposium 2024 - 2023
- [j117]Fan Yang
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. Discret. Math. 346(4): 113298 (2023) - [c12]Yuhong Nan, Xueqiang Wang, Luyi Xing, Xiaojing Liao, Ruoyu Wu, Jianliang Wu, Yifan Zhang, XiaoFeng Wang:
Are You Spying on Me? Large-Scale Analysis on IoT Data Exposure through Companion Apps. USENIX Security Symposium 2023: 6665-6682 - [i10]Zhong Zhang, Jian-Liang Wu, Cunquan Qu, Fei Jing:
The generation and regulation of public opinion on multiplex social networks. CoRR abs/2303.13912 (2023) - 2022
- [j116]Fan Yang
The linear arboricity of K5-minor free graphs. Discret. Appl. Math. 322: 49-60 (2022) - [j115]Jieru Feng, Yue Wang
On generalized neighbor sum distinguishing index of planar graphs. Discret. Math. Algorithms Appl. 14(4): 2150147:1-2150147:9 (2022) - [j114]Fan Yang
The total coloring of K5-minor-free graphs. Eur. J. Comb. 102: 103510 (2022) - [j113]Fei Jing
Toward Structural Controllability and Predictability in Directed Networks. IEEE Trans. Syst. Man Cybern. Syst. 52(12): 7692-7701 (2022) - [c11]Jianliang Wu, Ruoyu Wu, Dongyan Xu, Dave Jing Tian, Antonio Bianchi:
Formal Model-Driven Discovery of Bluetooth Protocol Design Vulnerabilities. SP 2022: 2285-2303 - [c10]Fei Wang, Jianliang Wu, Yuhong Nan, Yousra Aafer, Xiangyu Zhang, Dongyan Xu, Mathias Payer:
ProFactory: Improving IoT Security via Formalized Protocol Customization. USENIX Security Symposium 2022: 3879-3896 - 2021
- [j112]Jieru Feng
The edge colorings of K5-minor free graphs. Discret. Math. 344(6): 112360 (2021) - [j111]Linna Hu, Lei Sun, Jian-Liang Wu:
List edge coloring of planar graphs without 6-cycles with two chords. Discuss. Math. Graph Theory 41(1): 199-211 (2021) - [j110]Ya-Wei Niu, Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Guiying Yan:
Information spreading with relative attributes on signed networks. Inf. Sci. 551: 54-66 (2021) - [c9]Jianliang Wu
LIGHTBLUE: Automatic Profile-Aware Debloating of Bluetooth Stacks. USENIX Security Symposium 2021: 339-356 - [i9]Fei Jing, Chuang Liu, Yi-Cheng Zhang, Jian-Liang Wu, Zi-Ke Zhang:
Toward Structural Controllability and Predictability in Directed Networks. CoRR abs/2107.09639 (2021) - 2020
- [j109]Fanpeng Song
Transcendental behavior and disturbance behavior favor human development. Appl. Math. Comput. 378: 125182 (2020) - [j108]Zuosong Liang, Jianliang Wu
List-coloring clique-hypergraphs of K5-minor-free graphs strongly. Discret. Math. 343(4): 111777 (2020) - [j107]Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu:
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discret. Math. 343(7): 111856 (2020) - [j106]Bin Liu, Lin Sun, Bing Wang, Jian-Liang Wu:
The list coloring and list total coloring of planar graphs with maximum degree at least 7. Discuss. Math. Graph Theory 40(4): 1005-1024 (2020) - [c8]Jianliang Wu, Yuhong Nan, Vireshwar Kumar, Mathias Payer, Dongyan Xu:
BlueShield: Detecting Spoofing Attacks in Bluetooth Low Energy Networks. RAID 2020: 397-411 - [c7]Jianliang Wu
BLESA: Spoofing Attacks against Reconnections in Bluetooth Low Energy. WOOT @ USENIX Security Symposium 2020
2010 – 2019
- 2019
- [j105]Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu:
Graphs are (1, Δ+1)-choosable. Discret. Math. 342(1): 279-284 (2019) - [j104]Jie Hu, Guanghui Wang, Jianliang Wu
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discret. Math. 342(5): 1392-1402 (2019) - [j103]Yue Wang, Jianliang Wu
On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discret. Math. 342(6): 1782-1791 (2019) - [j102]Lin Sun, Jian-Liang Wu:
On edge colorings of 1-planar graphs without 5-cycles with two chords. Discuss. Math. Graph Theory 39(2): 301-312 (2019) - [j101]Aijun Dong, Jianliang Wu:
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j100]Shengjin Ji
A lower bound of revised Szeged index of bicyclic graphs. Appl. Math. Comput. 316: 480-487 (2018) - [j99]Xiaowei Yu, Jie Hu, Donglei Yang
Local antimagic labeling of graphs. Appl. Math. Comput. 322: 30-39 (2018) - [j98]Wenwen Zhang, Jian-Liang Wu:
A note on the edge colorings of planar graphs without 7-cycles with three chords. Ars Comb. 138: 393-402 (2018) - [j97]Aijun Dong, Jianliang Wu:
Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles. Ars Comb. 139: 361-383 (2018) - [j96]Shengjin Ji, Qiuju Bian, Jianfeng Wang, Jianliang Wu:
On the first reformulated Zagreb indices of graphs with a given clique number. Ars Comb. 140: 3-11 (2018) - [j95]Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu
Planar graphs without chordal 6-cycles are 4-choosable. Discret. Appl. Math. 244: 116-123 (2018) - [j94]Huimin Song
List r-hued chromatic number of graphs with bounded maximum average degrees. Discret. Math. 341(5): 1244-1252 (2018) - [j93]Lin Sun, Bing Wang, Jian-Liang Wu:
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles. Discuss. Math. Graph Theory 38(4): 977-989 (2018) - [j92]Donglei Yang
On splitting digraphs. Eur. J. Comb. 71: 174-179 (2018) - [j91]Min Liu, Zhen Xiong, Yue Ma, Peng Zhang, Jianliang Wu, Xingqin Qi
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix. Future Gener. Comput. Syst. 83: 376-389 (2018) - [j90]Jingcheng Fu, Jianwen Li
Multipolarization versus unification in community networks. Future Gener. Comput. Syst. 83: 454-460 (2018) - [j89]Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. J. Comb. Optim. 35(1): 1-13 (2018) - [j88]Hua Cai, Jianliang Wu, Lin Sun:
Vertex arboricity of planar graphs without intersecting 5-cycles. J. Comb. Optim. 35(2): 365-372 (2018) - [j87]Haiying Wang
List-edge-coloring of planar graphs without 6-cycles with three chords. J. Comb. Optim. 35(2): 555-562 (2018) - [j86]Laihao Ding, Guanghui Wang, Jianliang Wu:
Generalized acyclic edge colorings via entropy compression. J. Comb. Optim. 35(3): 906-920 (2018) - [j85]Huijuan Wang, Bin Liu, Ling Gai
Minimum choosability of planar graphs. J. Comb. Optim. 36(1): 13-22 (2018) - [j84]Wenwen Zhang, Jian-Liang Wu:
Edge coloring of planar graphs without adjacent 7-cycles. Theor. Comput. Sci. 739: 59-64 (2018) - 2017
- [j83]Donglei Yang
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. Appl. Math. Comput. 314: 456-468 (2017) - [j82]Renyu Xu
A sufficient condition for a planar graph to be 4-choosable. Discret. Appl. Math. 224: 120-122 (2017) - [j81]Daiqiang Hu, Jian-Liang Wu
Planar graphs without intersecting 5-cycles are 4-choosable. Discret. Math. 340(8): 1788-1792 (2017) - [j80]Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu:
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. Graphs Comb. 33(4): 885-900 (2017) - [j79]Daiqiang Hu, Jian-Liang Wu, Donglei Yang
On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. Graphs Comb. 33(4): 945-953 (2017) - [j78]Lin Sun, Jian-Liang Wu:
On (p, 1)-total labelling of planar graphs. J. Comb. Optim. 33(1): 317-325 (2017) - [j77]Lin Sun, Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. J. Comb. Optim. 33(2): 779-790 (2017) - [j76]Xiaohan Cheng, Guanghui Wang, Jianliang Wu:
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10. J. Comb. Optim. 34(2): 383-397 (2017) - [j75]Guantao Chen, Yuping Gao, Songling Shan
Equitable vertex arboricity of 5-degenerate graphs. J. Comb. Optim. 34(2): 426-432 (2017) - 2016
- [j74]Gui-Xiang Dong, Jian-Liang Wu:
Entire Chromatic Number of 1-Tree. Ars Comb. 125: 201-208 (2016) - [j73]Huimin Song
On r-hued coloring of planar graphs with girth at least 6. Discret. Appl. Math. 198: 251-263 (2016) - [j72]Hongyu Chen, Jian-Liang Wu:
List injective coloring of planar graphs with girth g≥6. Discret. Math. 339(12): 3043-3051 (2016) - [j71]Yuping Gao, Guanghui Wang, Jian-Liang Wu:
A Relaxed Case on 1-2-3 Conjecture. Graphs Comb. 32(4): 1415-1421 (2016) - [j70]Renyu Xu
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic. J. Comb. Optim. 31(4): 1430-1442 (2016) - [j69]Hua Cai, Jianliang Wu, Lin Sun:
Total coloring of planar graphs without short cycles. J. Comb. Optim. 31(4): 1650-1664 (2016) - [j68]Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Xiaowei Yu:
On the neighbor sum distinguishing total coloring of planar graphs. Theor. Comput. Sci. 609: 162-170 (2016) - 2015
- [j67]Xiang-Yong Sun, Jian-Liang Wu:
Acyclic Total Colorings of Planar Graphs. Ars Comb. 123: 269-282 (2015) - [j66]Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu:
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. Discret. Appl. Math. 190-191: 34-41 (2015) - [j65]Huijuan Wang, Bin Liu, Jianliang Wu:
Total Coloring of Planar Graphs Without Chordal Short Cycles. Graphs Comb. 31(5): 1755-1764 (2015) - [j64]Jianliang Wu
PaddyFrog: systematically detecting confused deputy vulnerability in Android applications. Secur. Commun. Networks 8(13): 2338-2349 (2015) - [j63]Wenwen Zhang, Jian-Liang Wu:
Some sufficient conditions for 1-planar graphs to be Class 1. Theor. Comput. Sci. 566: 50-58 (2015) - [c6]Chaoshun Zuo, Jianliang Wu
Automatically Detecting SSL Error-Handling Vulnerabilities in Hybrid Mobile Web Apps. AsiaCCS 2015: 591-596 - [c5]Guangdong Bai, Jun Sun
All Your Sessions Are Belong to Us: Investigating Authenticator Leakage through Backup Channels on Android. ICECCS 2015: 60-69 - 2014
- [j62]Jian Chang, Jian-Liang Wu, Huijuan Wang, Zhan-Hai Guo:
Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8. Electron. J. Comb. 21(1): 1 (2014) - [j61]Bing Wang, Jian-Liang Wu
Total colorings of planar graphs without chordal 6-cycles. Discret. Appl. Math. 171: 116-121 (2014) - [j60]Jingcheng Fu, Guanghui Wang, Jianliang Wu, Jin Xu:
A note on Edge Weight choosability of graphs. Discret. Math. Algorithms Appl. 6(1) (2014) - [j59]Huijuan Wang, Jianliang Wu, Bin Liu, Hongyu Chen:
On the linear arboricity of graphs embeddable in surfaces. Inf. Process. Lett. 114(9): 475-479 (2014) - [j58]Zhaoyang Luo, Jian-Liang Wu:
Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications. J. Appl. Math. 2014: 241712:1-241712:8 (2014) - [j57]Huijuan Wang, Lidong Wu, Weili Wu, Jianliang Wu:
Minimum number of disjoint linear forests covering a planar graph. J. Comb. Optim. 28(1): 274-287 (2014) - [j56]Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu, Wenwen Zhang:
Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle. J. Comb. Optim. 28(3): 692-715 (2014) - [j55]Huijuan Wang, Lidong Wu, Weili Wu, Panos M. Pardalos, Jian-Liang Wu:
Minimum total coloring of planar graph. J. Glob. Optim. 60(4): 777-791 (2014) - [j54]Jin Xu, Jianghua Zhang
Quantity strategies in economic networks. Oper. Res. Lett. 42(6-7): 379-382 (2014) - [j53]Wei-Ping Ni, Jian-Liang Wu:
Edge coloring of planar graphs which any two short cycles are adjacent at most once. Theor. Comput. Sci. 516: 133-138 (2014) - [j52]Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu:
Total coloring of embedded graphs with maximum degree at least seven. Theor. Comput. Sci. 518: 1-9 (2014) - [j51]Jian-Liang Wu, Ling Xue:
Edge colorings of planar graphs without 5-cycles with two chords. Theor. Comput. Sci. 518: 124-127 (2014) - [j50]Renyu Xu
Total coloring of planar graphs with 7-cycles containing at most two chords. Theor. Comput. Sci. 520: 124-129 (2014) - [j49]Huijuan Wang, Lidong Wu, Jianliang Wu:
Total coloring of planar graphs with maximum degree 8. Theor. Comput. Sci. 522: 54-61 (2014) - [j48]Jian Chang, Jian-Liang Wu, Yong-Ga A:
Total colorings of planar graphs with sparse triangles. Theor. Comput. Sci. 526: 120-129 (2014) - [c4]Guangdong Bai
TrustFound: Towards a Formal Foundation for Model Checking Trusted Computing Platforms. FM 2014: 110-126 - 2013
- [j47]Lian-Cui Zuo, Bang-Jun Li, Jianliang Wu:
The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs. Ars Comb. 111: 427-444 (2013) - [j46]Jian-Liang Wu, Xin Zhang
Equitable vertex arboricity of graphs. Discret. Math. 313(23): 2696-2701 (2013) - [j45]Hongyu Chen, Xiang Tan, Jianliang Wu, Guojun Li:
The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords. Graphs Comb. 29(3): 373-385 (2013) - [j44]Jianfeng Hou, Jian-Liang Wu:
Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs". J. Graph Theory 72(3): 364-365 (2013) - [j43]Jian Chang, Huijuan Wang, Jian-Liang Wu, Yong-Ga A:
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theor. Comput. Sci. 476: 16-23 (2013) - 2012
- [j42]Bing Wang, Jianliang Wu:
Total colorings of planar graphs without intersecting 5-cycles. Discret. Appl. Math. 160(12): 1815-1821 (2012) - [j41]Xin Zhang
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs. Discret. Math. 312(5): 999-1005 (2012) - [j40]Huijuan Wang, Jian-Liang Wu:
A note on the total coloring of planar graphs without adjacent 4-cycles. Discret. Math. 312(11): 1923-1926 (2012) - [j39]Xin Zhang
Edge covering pseudo-outerplanar graphs with forests. Discret. Math. 312(18): 2788-2799 (2012) - [j38]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Acyclic Edge Coloring of Planar Graphs Without Small Cycles. Graphs Comb. 28(2): 215-226 (2012) - [j37]Marek Cygan
A Planar linear arboricity conjecture. J. Graph Theory 69(4): 403-425 (2012) - [i8]Jianliang Wu, Xin Zhang, Hailun Li:
Equitable vertex arboricity of graphs. CoRR abs/1211.4193 (2012) - [i7]Xin Zhang, Jianliang Wu:
A conjecture on equitable vertex arboricity of graphs. CoRR abs/1211.4998 (2012) - 2011
- [j36]Jian-Liang Wu, Yu-Wen Wu:
Edge colorings of planar graphs with maximum degree five. Ars Comb. 98: 183-191 (2011) - [j35]Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu:
Total coloring of planar graphs without 6-cycles. Discret. Appl. Math. 159(2-3): 157-163 (2011) - [j34]Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu:
Circular vertex arboricity. Discret. Appl. Math. 159(12): 1231-1238 (2011) - [j33]Xin Zhang
On equitable and equitable list colorings of series-parallel graphs. Discret. Math. 311(10-11): 800-803 (2011) - [j32]Bing Wang, Jianliang Wu:
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles. Discret. Math. 311(18-19): 2025-2030 (2011) - [j31]Xin Zhang
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. Discret. Math. Theor. Comput. Sci. 13(3): 9-16 (2011) - [j30]Xin Zhang
On edge colorings of 1-planar graphs. Inf. Process. Lett. 111(3): 124-128 (2011) - [j29]Jianfeng Hou, Nicolas Roussel, Jianliang Wu:
Acyclic chromatic index of planar graphs with triangles. Inf. Process. Lett. 111(17): 836-840 (2011) - [j28]Bing Wang, Jianliang Wu:
Total coloring of planar graphs with maximum degree 7. Inf. Process. Lett. 111(20): 1019-1021 (2011) - [j27]Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang
A note on relaxed equitable coloring of graphs. Inf. Process. Lett. 111(21-22): 1062-1066 (2011) - [i6]Xin Zhang, Guizhen Liu, Jianliang Wu:
k-forested choosability of graphs with bounded maximum average degree. CoRR abs/1102.3987 (2011) - [i5]Xin Zhang, Guizhen Liu, Jianliang Wu:
(1,λ)-embedded graphs and the acyclic edge choosability. CoRR abs/1106.4681 (2011) - [i4]Xin Zhang, Guizhen Liu, Jianliang Wu:
Edge covering pseudo-outerplanar graphs with forests. CoRR abs/1108.3877 (2011) - 2010
- [j26]Xin Zhang
Vertex-disjoint triangles in K1, t-free graphs with minimum degree at least t. Discret. Math. 310(19): 2499-2503 (2010) - [j25]Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu:
Acyclic edge chromatic number of outerplanar graphs. J. Graph Theory 64(1): 22-36 (2010) - [i3]Xin Zhang, Guizhen Liu, Jianliang Wu:
Structural properties of 1-planar graphs and an application to acyclic edge coloring. CoRR abs/1008.5000 (2010) - [i2]Xin Zhang, Jianliang Wu, Jin Yan:
Degree conditions for the partition of a graph into triangles and quadrilaterals. CoRR abs/1012.5920 (2010) - [i1]Xin Zhang, Guizhen Liu, Jianliang Wu:
Edge Coloring of Triangle-Free 1-Planar Graphs. CoRR abs/1012.5921 (2010)
2000 – 2009
- 2009
- [j24]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability. Ars Comb. 91 (2009) - [j23]Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou:
Total colorings of planar graphs without adjacent triangles. Discret. Math. 309(1): 202-206 (2009) - [j22]Lian-Cui Zuo, Qinglin Yu, Jianliang Wu:
Vertex arboricity of integer distance graph G(Dm, k). Discret. Math. 309(6): 1649-1657 (2009) - [j21]Qin Ma
Planar graphs without 5-cycles or without 6-cycles. Discret. Math. 309(10): 2998-3005 (2009) - [j20]Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu:
Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discret. Math. 309(20): 6035-6043 (2009) - 2008
- [j19]Jian-Liang Wu, Yu-Liang Wu:
The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree. Ars Comb. 86 (2008) - [j18]Jianliang Wu, Ping Wang:
Equitable coloring planar graphs with large girth. Discret. Math. 308(5-6): 985-990 (2008) - [j17]Jianliang Wu, Ping Wang:
List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. Discret. Math. 308(24): 6210-6215 (2008) - [j16]Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan:
Total Colorings of Planar Graphs without Small Cycles. Graphs Comb. 24(2): 91-100 (2008) - [j15]Jian-Liang Wu, Yu-Wen Wu:
The linear arboricity of planar graphs of maximum degree seven is four. J. Graph Theory 58(3): 210-220 (2008) - [j14]Jian-Liang Wu:
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic. SIAM J. Discret. Math. 23(1): 54-58 (2008) - 2007
- [j13]Jianliang Wu, Jianfeng Hou, Guizhen Liu:
The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci. 381(1-3): 230-233 (2007) - [c3]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Some Results on List Total Colorings of Planar Graphs. International Conference on Computational Science (3) 2007: 320-328 - [c2]Jianliang Wu, Ping Wang:
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs. International Conference on Computational Science (3) 2007: 389-396 - [c1]Huimin Song, Jianliang Wu, Guizhen Liu:
The Equitable Edge-Coloring of Series-Parallel Graphs. International Conference on Computational Science (3) 2007: 457-460 - 2006
- [j12]Lian-Cui Zuo, Qinglin Yu, Jianliang Wu:
Tree coloring of distance graphs with a real interval set. Appl. Math. Lett. 19(12): 1341-1344 (2006) - [j11]Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu:
The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set. Ars Comb. 79 (2006) - [j10]Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu:
The Fractional Vertex Linear Arboricity of Graphs. Ars Comb. 81 (2006) - [j9]Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu:
The vertex linear arboricity of distance graphs. Discret. Math. 306(2): 284-289 (2006) - 2005
- [j8]Jianliang Wu, Ping Wang, Anthony J. W. Hilton:
Two sufficient conditions for a graph to be type 1. Ars Comb. 76 (2005) - 2004
- [j7]Jian-Liang Wu, Daiqiang Hu:
Total Coloring of Series-Parallel Graphs. Ars Comb. 73 (2004) - [j6]Peter Dankelmann
Minimum average distance of strong orientations of graphs. Discret. Appl. Math. 143(1-3): 204-212 (2004) - [j5]Ping Wang, Jianliang Wu:
A note on total colorings of planar graphs without 4-cycles. Discuss. Math. Graph Theory 24(1): 125-135 (2004) - 2003
- [j4]Lianying Miao, Shiyou Pang, Jianliang Wu:
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. Discret. Math. 271(1-3): 321-325 (2003) - 2002
- [j3]Lianying Miao, Jianliang Wu:
Edge-coloring critical graphs with high degree. Discret. Math. 257(1): 169-172 (2002) - 2000
- [j2]Jianliang Wu:
The Linear Arboricity of Series-Parallel Graphs. Graphs Comb. 16(3): 367-372 (2000)
1990 – 1999
- 1999
- [j1]Jian-Liang Wu:
On the linear arboricity of planar graphs. J. Graph Theory 31(2): 129-134 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: