代表成果与荣誉
目前主要研究领域是图的染色与标号、荫度与分解、算法分析及应用等，在J. Graph Theory, SIAM J. Discrere Math., European J. Combin., Discrete Math.等期刊上发表SCI论文80余篇，代表作如下：
[1]Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih, Plane graphs of maximum degree ∆≥7 are edge-face (∆+1)-colorable, Journal of Graph Theory, 95(2020), 99–124.
[2]Yang Wang, Yiqiao Wang, Ko-Wei Lih, Partitioning kite-free planar graphs into two forests, Journal of Graph Theory, (2023), 1–27.https://doi.org/10.1002/jgt.23062.
[3]Juan Liu, Yiqiao Wang, Weifan Wang, Light edges in 1‐planar graphs, Journal of Graph Theory,
101(2022), 746–768.
[4]Jianfeng Wang, Wenqian Zhang, Yiqiao Wang, Zoran Stanić, On the order of antipodal covers,
Journal of Graph Theory, 105(2023), 285–296.
[5]Qiaojun Shu, Weifan Wang, Yiqiao Wang, Acyclic chromatic indices of planar graphs with girth
at least 4, Journal of Graph Theory, 73(2013), 386–399.
[6]Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Plane graphs with ∆≥9 are entirely (∆+2)-colorable,
SIAM Journal on Discrete Mathematics, 28(2014), 1892–1905.
[7]Wanshun Yang, Yiqiao Wang, Weifan Wang, Ko-Wei Lih, IC-planar graphs are 6-choosable,
SIAM Journal on Discrete Mathematics, 35(2021), 1729–1745.
[8]Weifan Wang, Xiaoxue Hu,Yiqiao Wang, Entire coloring of 2-connected plane graphs, European Journal of Combinatorics, 94(2021), 103286.
[9]Weifan Wang, Qiaojun Shu, Yiqiao Wang, A new upper bound on the acyclic chromatic indices
of planar graphs, European Journal of Combinatorics, 34(2013), 338–354.
[10]Yiqiao Wang, An improved upper bound on the linear 2-arboricity of planar graphs, Discrete
Mathematics, 339(2016), 39–45.
[11]Yiqiao Wang, Yanping Yang, Danjun Huang, Weifan Wang, Two sufficient conditions for a
planar graph to be list vertex-2-arborable, Discrete Mathematics, 345(2022), 112865.
[12]Yiqiao Wang, Min Chen, Weifan Wang, A note on the list vertex arboricity of toroidal graphs,
Discrete Mathematics, 341(2018), 3344–3347.
[13]Yiqiao Wang, Weifan Wang, Jingjing Huo, Some bounds on the neighbor-distinguishing index
of graphs, Discrete Mathematics, 338(2015), 2006–2013.
[14]Yiqiao Wang, Qiaojun Shu, Weifan Wang, The acyclic edge coloring of planar graphs without a
3-cycle adjacent to a 4-cycle, Discrete Applied Mathematics, 161(2013), 2687–2694.
[15]Wanshun Yang, Weifan Wang, Yiqiao Wang, An improved upper bound for the acyclic chromatic
number of 1-planar graphs, Discrete Applied Mathematics, 283(2020), 275–291.
[16]Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang, Light structures in 1-planar graphs with an
application to linear 2-arboricity, Discrete Applied Mathematics, 267(2019), 120–130.
[17]Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhao, Equitable total-coloring of subcubic graphs,
Discrete Applied Mathematics, 184 (2015), 167–170.
[18]Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Dingzhu Du, A polynomial-time
nearly-optimal algorithm for an edge coloring problem in outerplanar graphs, Journal of Global
Optimization, 65(2016), 351–367.
[19]Weifan Wang, Yiqiao Wang, Adjacent vertex distinguishing edge colorings of K4-minor free graphs,
Applied Mathematics Letters, 24(2011), 2034–2037.
[20]Qiaojun Shu, Weifan Wang, Yiqiao Wang, A new sufficient condition for a tree T to have the (2,1)-total
number ∆+1, Journal of Combinatorial Optimization, 33(2017), 1011–1020.
