Weifan Wang

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 62

Top Venues

Publications

Wei Gao, Yiqiao Wang, Weifan Wang
A sufficient condition for a graph to be fractional (k,n)-critical. Discret. Math. 347 (6) (2024)
Wenqian Zhang, Jianfeng Wang, Weifan Wang
Spectral extrema of 1-planar graphs. Discret. Math. 347 (9) (2024)
Ganchao Zhang, Min Chen, Weifan Wang
A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable. Appl. Math. Comput. 474 (2024)
Yang Wang, Jiali Wang, Weifan Wang, Jiangxu Kong
Partitioning planar graphs into bounded degree forests. Appl. Math. Comput. 474 (2024)
Yang Wang, Yiqiao Wang, Weifan Wang, Lina Zheng
A note on the list vertex-arboricity of IC-planar graphs. Discret. Math. 347 (7) (2024)
Weifan Wang, Juan Liu, Yiqiao Wang
Linear arboricity of 1-planar graphs. Discuss. Math. Graph Theory 44 (2) (2024)
Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang
Plane graphs of diameter two are 2-optimal. Appl. Math. Comput. 441 (2023)
Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu
)-partition of planar graphs with girth at least 5. Discret. Math. 346 (2) (2023)
Wei Gao, Weifan Wang, Yaojun Chen
)-critical graphs. Connect. Sci. 35 (1) (2023)
Jiahao Yu, Min Chen, Weifan Wang
2-Distance choosability of planar graphs with a restriction for maximum degree. Appl. Math. Comput. 448 (2023)
Chenran Pan, Weifan Wang, Runrun Liu
IC-planar graphs are odd-10-colorable. Appl. Math. Comput. 451 (2023)
Aina Zhu, Dong Chen, Min Chen, Weifan Wang
Vertex-arboricity of toroidal graphs without K5- and 6-cycles. Discret. Appl. Math. 310 (2022)
Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, Cun-Quan Zhang
Nowhere-zero 3-flows in toroidal graphs. J. Comb. Theory, Ser. B 153 (2022)
Jiaao Li, Yulai Ma, Yongtang Shi, Weifan Wang, Yezhou Wu
On 3-flow-critical graphs. Eur. J. Comb. 100 (2022)
Yiqiao Wang, Yanping Yang, Danjun Huang, Weifan Wang
Two sufficient conditions for a planar graph to be list vertex-2-arborable. Discret. Math. 345 (6) (2022)
Juan Liu, Yiqiao Wang, Weifan Wang
Light edges in 1-planar graphs. J. Graph Theory 101 (4) (2022)
Runrun Liu, Weifan Wang
A sufficient condition for a planar graph to be (F, F2)-partitionable. Discret. Appl. Math. 318 (2022)
Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du, Weifan Wang
Structure and pancyclicity of maximal planar graphs with diameter two. J. Comb. Optim. 43 (1) (2022)
Ying Wang, Yiqiao Wang, Weifan Wang, Shuyu Cui
Strong Chromatic Index of Outerplanar Graphs. Axioms 11 (4) (2022)
Yiqiao Wang, Juan Liu, Yongtang Shi, Weifan Wang
Star Chromatic Index of 1-Planar Graphs. Symmetry 14 (6) (2022)
Wei Gao, Weifan Wang, Lina Zheng
Fuzzy fractional factors in fuzzy graphs. Int. J. Intell. Syst. 37 (11) (2022)
Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang
A note on strong edge choosability of toroidal subcubic graphs. Australas. J Comb. 79 (2021)
Jing Gu, Weifan Wang, Yiqiao Wang, Ying Wang
Strict Neighbor-Distinguishing Index of Subcubic Graphs. Graphs Comb. 37 (1) (2021)
Weifan Wang, Xiaoxue Hu, Yiqiao Wang
Entire coloring of 2-connected plane graphs. Eur. J. Comb. 94 (2021)
Yulai Ma, Yongtang Shi, Weifan Wang
Acyclic Edge Coloring of Chordal Graphs with Bounded Degree. Graphs Comb. 37 (6) (2021)
Wei Gao, Weifan Wang
-factor uniform graphs. Inf. Process. Lett. 172 (2021)
Wei Gao, Weifan Wang, Yaojun Chen
Tight bounds for the existence of path factors in network vulnerability parameter settings. Int. J. Intell. Syst. 36 (3) (2021)
Danjun Huang, Xiaoxiu Zhang, Weifan Wang, Stephen Finbow
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles. Discret. Math. Algorithms Appl. 12 (4) (2020)
Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. J. Graph Theory 95 (1) (2020)
Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang
Choosability with separation of planar graphs without prescribed cycles. Appl. Math. Comput. 367 (2020)
Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. J. Comb. Optim. 39 (1) (2020)
Wanshun Yang, Weifan Wang, Yiqiao Wang
An improved upper bound for the acyclic chromatic number of 1-planar graphs. Discret. Appl. Math. 283 (2020)
Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang
Light structures in 1-planar graphs with an application to linear 2-arboricity. Discret. Appl. Math. 267 (2019)
Wanshun Yang, Weifan Wang, Yiqiao Wang
Acyclic coloring of IC-planar graphs. Discret. Math. 342 (12) (2019)
Ying Wang, Yiqiao Wang, Weifan Wang
Star edge-coloring of graphs with maximum degree four. Appl. Math. Comput. 340 (2019)
Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. J. Comb. Optim. 37 (3) (2019)
Danjun Huang, Yiqiao Wang, Jing Lv, Yanping Yang, Weifan Wang
List coloring and diagonal coloring for plane graphs of diameter two. Appl. Math. Comput. 363 (2019)
Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu
Planar graphs without chordal 6-cycles are 4-choosable. Discret. Appl. Math. 244 (2018)
Min Chen, Weiqiang Yu, Weifan Wang
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. Appl. Math. Comput. 326 (2018)
Jingjing Huo, Weifan Wang, Yiqiao Wang
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. Discret. Math. 341 (11) (2018)
Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen
Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discret. Math. 341 (6) (2018)
Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang
Planar graphs without chordal 5-cycles are 2-good. J. Comb. Optim. 35 (3) (2018)
Yiqiao Wang, Min Chen, Weifan Wang
A note on the list vertex arboricity of toroidal graphs. Discret. Math. 341 (12) (2018)
Wei Gao, Weifan Wang
Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion. Int. J. Comput. Math. 95 (8) (2018)
Yiqiao Wang, Weifan Wang, Ying Wang
Edge-partition and star chromatic index. Appl. Math. Comput. 333 (2018)
Yiqiao Wang, Ping Wang, Weifan Wang
-minor free graphs. Inf. Process. Lett. 129 (2018)
Xiaoxue Hu, Weifan Wang, Yiqiao Wang, Ping Wang
Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. Graphs Comb. 34 (6) (2018)
Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen
2-Distance vertex-distinguishing index of subcubic graphs. J. Comb. Optim. 36 (1) (2018)
Yafang Hu, Weifan Wang
2-distance vertex-distinguishing total coloring of graphs. Discret. Math. Algorithms Appl. 10 (2) (2018)
Jingjing Huo, Wai Chee Shiu, Weifan Wang
The neighbor expanded sum distinguishing index of Halin graphs. Ars Comb. 141 (2018)
Yiqiao Wang, Xiaoxue Hu, Weifan Wang
The chromatic number of the square of a Halin graph with maximum degree five is six. Ars Comb. 133 (2017)
Jingjing Huo, Weifan Wang, Chuandong Xu
Neighbor Sum Distinguishing Index of Subcubic Graphs. Graphs Comb. 33 (2) (2017)
Qiaojun Shu, Weifan Wang, Yiqiao Wang
A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. J. Comb. Optim. 33 (3) (2017)
Jingjing Huo, Yiqiao Wang, Weifan Wang
Neighbor-sum-distinguishing edge choosability of subcubic graphs. J. Comb. Optim. 34 (3) (2017)
Xiaoxue Hu, Ping Wang, Yiqiao Wang, Weifan Wang
The entire chromatic number of graphs embedded on the torus with large maximum degree. Theor. Comput. Sci. 689 (2017)
Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang
A sufficient condition for planar graphs to be (3, 1)-choosable. J. Comb. Optim. 34 (4) (2017)
Min Chen, Li Huang, Weifan Wang
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. Discret. Math. 339 (10) (2016)
Min Chen, André Raspaud, Weifan Wang
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32 (3) (2016)
Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. J. Comb. Optim. 31 (2) (2016)
Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang
Rainbow cliques in edge-colored graphs. Eur. J. Comb. 54 (2016)
Xiaoxue Hu, Weifan Wang, Wai Chee Shiu, Yiqiao Wang
Plane graphs with maximum degree 9 are entirely 11-choosable. Discret. Math. 339 (11) (2016)
Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. J. Glob. Optim. 65 (2) (2016)
Dong Chen, Wai Chee Shiu, Qiaojun Shu, Pak Kiu Sun, Weifan Wang
(2, 1)-total labeling of trees with large maximum degree. Discret. Appl. Math. 187 (2015)
Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang
Equitable total-coloring of subcubic graphs. Discret. Appl. Math. 184 (2015)
Wei Gao, Weifan Wang
The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures. Comput. Math. Methods Medicine 2015 (2015)
Danjun Huang, Zhengke Miao, Weifan Wang
Adjacent vertex distinguishing indices of planar graphs without 3-cycles. Discret. Math. 338 (3) (2015)
Xiaoxue Hu, Weifan Wang, Yiqiao Wang
The edge-face choosability of plane graphs with maximum degree at least 9. Discret. Math. 327 (2014)
Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. J. Comb. Optim. 28 (4) (2014)
Mirko Hornák, Danjun Huang, Weifan Wang
On Neighbor-Distinguishing Index of Planar Graphs. J. Graph Theory 76 (4) (2014)
Lianzhu Zhang, Weifan Wang, Ko-Wei Lih
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Discret. Appl. Math. 162 (2014)
Min Chen, André Raspaud, Weifan Wang
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30 (4) (2014)
Weifan Wang, Stephen Finbow, Ping Wang
A lower bound of the surviving rate of a planar graph with girth at least seven. J. Comb. Optim. 27 (4) (2014)
Weifan Wang, Danjun Huang
The adjacent vertex distinguishing total coloring of planar graphs. J. Comb. Optim. 27 (2) (2014)
Min Chen, André Raspaud, Weifan Wang
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27 (3) (2014)
Weifan Wang, Stephen Finbow, Jiangxu Kong
The 2-surviving rate of planar graphs without 6-cycles. Theor. Comput. Sci. 518 (2014)
Qiaojun Shu, Yiqiao Wang, Weifan Wang
Acyclic list edge coloring of outerplanar graphs. Discret. Math. 313 (3) (2013)
Weifan Wang, Yiqiao Wang
Linear Coloring of Planar Graphs Without 4-Cycles. Graphs Comb. 29 (4) (2013)
Weifan Wang, Qiaojun Shu, Yiqiao Wang
A new upper bound on the acyclic chromatic indices of planar graphs. Eur. J. Comb. 34 (2) (2013)
Yiqiao Wang, Qiaojun Shu, Weifan Wang
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Discret. Appl. Math. 161 (16-17) (2013)
Weifan Wang, Qiaojun Shu, Yiqiao Wang
Acyclic edge coloring of planar graphs without 4-cycles. J. Comb. Optim. 25 (4) (2013)
Danjun Huang, Weifan Wang
Vertex arboricity of planar graphs without chordal 6-cycles. Int. J. Comput. Math. 90 (2) (2013)
Min Chen, André Raspaud, Weifan Wang
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72 (2) (2013)
Qiaojun Shu, Weifan Wang, Yiqiao Wang
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. J. Graph Theory 73 (4) (2013)
Qiaojun Shu, Weifan Wang, Yiqiao Wang
Acyclic edge coloring of planar graphs without 5-cycles. Discret. Appl. Math. 160 (7-8) (2012)
Weifan Wang, Qiaojun Shu, Yiqiao Wang
Every 4-regular graph is acyclically edge-6-colorable CoRR (2012)
Danjun Huang, Weifan Wang, Chengchao Yan
A note on the adjacent vertex distinguishing total chromatic number of graphs. Discret. Math. 312 (24) (2012)
Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
On backbone coloring of graphs. J. Comb. Optim. 23 (1) (2012)
Min Chen, André Raspaud, Weifan Wang
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33 (5) (2012)
Danjun Huang, Wai Chee Shiu, Weifan Wang
On the vertex-arboricity of planar graphs without 7-cycles. Discret. Math. 312 (15) (2012)
Jiangxu Kong, Weifan Wang, Xuding Zhu
The surviving rate of planar graphs. Theor. Comput. Sci. 416 (2012)
Qiaojun Shu, Weifan Wang
Acyclic chromatic indices of planar graphs with girth at least five. J. Comb. Optim. 23 (1) (2012)
Weifan Wang, Jiangxu Kong, Lianzhu Zhang
The 2-surviving rate of planar graphs without 4-cycles. Theor. Comput. Sci. 457 (2012)
Caiyue Ye, Meijie Ma, Weifan Wang
Fault tolerant path-embedding in locally twisted cubes. Ars Comb. 107 (2012)
Danjun Huang, Weifan Wang, Jianxing Yin
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107 (2012)
Min Chen, Gena Hahn, André Raspaud, Weifan Wang
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24 (3) (2012)
Danjun Huang, Weifan Wang
Planar Graphs of Maximum Degree Six without 7-cycles are Class One. Electron. J. Comb. 19 (3) (2012)
Weifan Wang, Stephen Finbow, Ping Wang
An improved bound on parity vertex colourings of outerplane graphs. Discret. Math. 312 (18) (2012)
Weifan Wang, Qiaojun Shu, Kan Wang, Ping Wang
Acyclic chromatic indices of planar graphs with large girth. Discret. Appl. Math. 159 (12) (2011)
Chao Li, Weifan Wang, André Raspaud
Upper bounds on the linear chromatic number of a graph. Discret. Math. 311 (4) (2011)
Min Chen, André Raspaud, Weifan Wang
8-star-choosability of a graph with maximum average degree less than 3. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)

Weifan Wang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Weifan Wang