L(p, q)-labelling of K4-minor free graphs. - Weifan Wang 001; Yiqiao Wang 002 (Inf. Process. Lett., 2006)

Adjacent vertex distinguishing total colorings of outerplanar graphs. - Yiqiao Wang 002; Weifan Wang 001 (J. Comb. Optim., 2010)

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. - Weifan Wang 001; Yiqiao Wang 002 (J. Comb. Optim., 2010)

Adjacent vertex-distinguishing edge colorings of K4-minor free graphs. - Weifan Wang 001; Yiqiao Wang 002 (Appl. Math. Lett., 2011)

Every 4-regular graph is acyclically edge-6-colorable - Weifan Wang 001; Qiaojun Shu; Yiqiao Wang 002 (CoRR, 2012)

Acyclic edge coloring of planar graphs without 5-cycles. - Qiaojun Shu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2012)

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. - Yiqiao Wang 002; Qiaojun Shu; Weifan Wang 001 (Discret. Appl. Math., 2013)

Acyclic list edge coloring of outerplanar graphs. - Qiaojun Shu; Yiqiao Wang 002; Weifan Wang 001 (Discret. Math., 2013)

A new upper bound on the acyclic chromatic indices of planar graphs. - Weifan Wang 001; Qiaojun Shu; Yiqiao Wang 002 (Eur. J. Comb., 2013)

Linear Coloring of Planar Graphs Without 4-Cycles. - Weifan Wang 001; Yiqiao Wang 002 (Graphs Comb., 2013)

Acyclic edge coloring of planar graphs without 4-cycles. - Weifan Wang 001; Qiaojun Shu; Yiqiao Wang 002 (J. Comb. Optim., 2013)

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. - Qiaojun Shu; Weifan Wang 001; Yiqiao Wang 002 (J. Graph Theory, 2013)

The edge-face choosability of plane graphs with maximum degree at least 9. - Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Math., 2014)

Plane graphs are entirely (δ + 5)-Choosable. - Xiaoxue Hu; Yiqiao Wang 002 (Discret. Math. Algorithms Appl., 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)

Planar Graphs with $ Delta ge 9$ are Entirely (Δ+2)-Colorable. - Yiqiao Wang 002; Xiaoxue Hu; Wei-Fan Wang 001 (SIAM J. Discret. Math., 2014)

Equitable total-coloring of subcubic graphs. - Hao Gui; Weifan Wang 001; Yiqiao Wang 002; Zhao Zhang 002 (Discret. Appl. Math., 2015)

Some bounds on the neighbor-distinguishing index of graphs. - Yiqiao Wang 002; Wei-Fan Wang 001; Jingjing Huo (Discret. Math., 2015)

Plane graphs with maximum degree 9 are entirely 11-choosable. - Xiaoxue Hu; Weifan Wang 001; Wai Chee Shiu; Yiqiao Wang 002 (Discret. Math., 2016)

The entire choosability of plane graphs. - Wei-Fan Wang 001; Tingting Wu; Xiaoxue Hu; Yiqiao Wang 002 (J. Comb. Optim., 2016)

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. - Weifan Wang 001; Danjun Huang; Yanwen Wang; Yiqiao Wang 002; Ding-Zhu Du (J. Glob. Optim., 2016)

The chromatic number of the square of a Halin graph with maximum degree five is six. - Yiqiao Wang 002; Xiaoxue Hu; Weifan Wang 001 (Ars Comb., 2017)

A note on the linear 2-arboricity of planar graphs. - Yiqiao Wang 002; Xiaoxue Hu; Wei-Fan Wang 001 (Discret. Math., 2017)

On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles. - Yiqiao Wang 002 (Int. J. Comput. Math., 2017)

A sufficient condition for planar graphs to be (3, 1)-choosable. - Min Chen 012; Yingying Fan; Yiqiao Wang 002; Weifan Wang 001 (J. Comb. Optim., 2017)

Neighbor-sum-distinguishing edge choosability of subcubic graphs. - Jingjing Huo; Yiqiao Wang 002; Weifan Wang 001 (J. Comb. Optim., 2017)

A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. - Qiaojun Shu; Weifan Wang 001; Yiqiao Wang 002 (J. Comb. Optim., 2017)

A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable. - Miao Zhang; Min Chen 012; Yiqiao Wang 002 (J. Comb. Optim., 2017)

The entire chromatic number of graphs embedded on the torus with large maximum degree. - Xiaoxue Hu; Ping Wang 023; Yiqiao Wang 002; Weifan Wang 001 (Theor. Comput. Sci., 2017)

Edge-partition and star chromatic index. - Yiqiao Wang 002; Weifan Wang 001; Ying Wang (Appl. Math. Comput., 2018)

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. - Jingjing Huo; Weifan Wang 001; Yiqiao Wang 002 (Discret. Math., 2018)

A note on the list vertex arboricity of toroidal graphs. - Yiqiao Wang 002; Min Chen 012; Weifan Wang 001 (Discret. Math., 2018)

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. - Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002; Ping Wang 023 (Graphs Comb., 2018)

Strong chromatic index of K4-minor free graphs. - Yiqiao Wang 002; Ping Wang 023; Weifan Wang 001 (Inf. Process. Lett., 2018)

Planar graphs without chordal 5-cycles are 2-good. - Weifan Wang 001; Tingting Wu; Xiaoxue Hu; Yiqiao Wang 002 (J. Comb. Optim., 2018)

List coloring and diagonal coloring for plane graphs of diameter two. - Danjun Huang; Yiqiao Wang 002; Jing Lv; Yanping Yang; Weifan Wang 001 (Appl. Math. Comput., 2019)

Star edge-coloring of graphs with maximum degree four. - Ying Wang; Yiqiao Wang 002; Weifan Wang 001 (Appl. Math. Comput., 2019)

Light structures in 1-planar graphs with an application to linear 2-arboricity. - Juan Liu; Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2019)

Acyclic coloring of IC-planar graphs. - Wanshun Yang; Weifan Wang 001; Yiqiao Wang 002 (Discret. Math., 2019)

Planar graphs with $$ Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. - Weifan Wang 001; Jingjing Huo; Danjun Huang; Yiqiao Wang 002 (J. Comb. Optim., 2019)

Computation on the difference of Zagreb indices of maximal planar graphs with diameter two. - Yiqiao Wang 002; Lina Zheng (Appl. Math. Comput., 2020)

An improved upper bound for the acyclic chromatic number of 1-planar graphs. - Wanshun Yang; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2020)

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. - Jingjing Huo; Yiqiao Wang 002; Weifan Wang 001; Wenjing Xia (J. Comb. Optim., 2020)

Plane graphs with Δ =7 are entirely 10-colorable. - Jiangxu Kong; Xiaoxue Hu; Yiqiao Wang 002 (J. Comb. Optim., 2020)

Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. - Yiqiao Wang 002; Xiaoxue Hu; Weifan Wang 001; Ko-Wei Lih (J. Graph Theory, 2020)

Entire coloring of 2-connected plane graphs. - Weifan Wang 001; Xiaoxue Hu; Yiqiao Wang 002 (Eur. J. Comb., 2021)

Strict Neighbor-Distinguishing Index of Subcubic Graphs. - Jing Gu; Weifan Wang 001; Yiqiao Wang 002; Ying Wang (Graphs Comb., 2021)

Network vulnerability parameter and results on two surfaces. - Wei Gao 012; Yaojun Chen; Yiqiao Wang 002 (Int. J. Intell. Syst., 2021)

IC-Planar Graphs Are 6-Choosable. - Wanshun Yang; Yiqiao Wang 002; Wei-Fan Wang 001; Ko-Wei Lih (SIAM J. Discret. Math., 2021)

Strong Chromatic Index of Outerplanar Graphs. - Ying Wang; Yiqiao Wang 002; Weifan Wang 001; Shuyu Cui (Axioms, 2022)

Two sufficient conditions for a planar graph to be list vertex-2-arborable. - Yiqiao Wang 002; Yanping Yang; Danjun Huang; Weifan Wang 001 (Discret. Math., 2022)

Structure and pancyclicity of maximal planar graphs with diameter two. - Shu-Yu Cui; Yiqiao Wang 002; Danjun Huang; Hongwei Du 001; Weifan Wang 001 (J. Comb. Optim., 2022)

Light edges in 1-planar graphs. - Juan Liu; Yiqiao Wang 002; Weifan Wang 001 (J. Graph Theory, 2022)

Star Chromatic Index of 1-Planar Graphs. - Yiqiao Wang 002; Juan Liu; Yongtang Shi; Weifan Wang 001 (Symmetry, 2022)

Plane graphs of diameter two are 2-optimal. - Jiangxu Kong; Yiqiao Wang 002; Jiacheng Hu; Yang Wang 107; Weifan Wang 001 (Appl. Math. Comput., 2023)

The strong chromatic index of 1-planar graphs. - Yiqiao Wang 002; Ning Song; Jianfeng Wang; Weifan Wang 001 (Discret. Math. Theor. Comput. Sci., 2023)

Function value ranking aware differential evolution for global numerical optimization. - Dong Liu 008; Hao He; Qiang Yang 008; Yiqiao Wang 002; Sang-Woon Jeon; Jun Zhang 003 (Swarm Evol. Comput., 2023)

Proximity ranking-based multimodal differential evolution. - Junna Zhang; Degang Chen 005; Qiang Yang 008; Yiqiao Wang 002; Dong Liu 008; Sang-Woon Jeon; Jun Zhang 003 (Swarm Evol. Comput., 2023)

L(2, 1)-Labeling Halin Graphs with Maximum Degree Eight. - Haizhen Qiu; Yushi Che; Yiqiao Wang 002 (Symmetry, 2023)

Strict neighbor-distinguishing index of K4-minor-free graphs. - Jing Gu; Yiqiao Wang 002; Weifan Wang 001; Lina Zheng (Discret. Appl. Math., 2023)

The Difference of Zagreb Indices of Halin Graphs. - Lina Zheng; Yiqiao Wang 002; Weifan Wang 001 (Axioms, 2023)

On critical graphs for the chromatic edge-stability number. - Hui Lei 002; Xiaopan Lian; Xianhao Meng; Yongtang Shi; Yiqiao Wang 002 (Discret. Math., 2023)

Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems. - En Zhang; Zihao Nie; Qiang Yang 008; Yiqiao Wang 002; Dong Liu 008; Sang-Woon Jeon; Jun Zhang 003 (Inf. Sci., 2023)

Predicting blood pressure from face videos using face diagnosis theory and deep neural networks technique. - Weiying Xing; Yinni Shi; Chaoyong Wu; Yiqiao Wang 002; Xu Wang (Comput. Biol. Medicine, 2023)

Coloring the square of maximal planar graphs with diameter two. - Yiqiao Wang 002; Jingjing Huo; Jiangxu Kong; Qiuyue Tan (Appl. Math. Comput., 2023)

A sufficient condition for a graph to be fractional (k,n)-critical. - Wei Gao 012; Yiqiao Wang 002; Weifan Wang 001 (Discret. Math., 2024)

A note on the list vertex-arboricity of IC-planar graphs. - Yang Wang 107; Yiqiao Wang 002; Weifan Wang 001; Lina Zheng (Discret. Math., 2024)

Linear arboricity of 1-planar graphs. - Weifan Wang 001; Juan Liu; Yiqiao Wang 002 (Discuss. Math. Graph Theory, 2024)

Partitioning kite-free planar graphs into two forests. - Yang Wang 107; Yiqiao Wang 002; Ko-Wei Lih (J. Graph Theory, 2024)

A note on rainbow-free colorings of uniform hypergraphs. - Ran Gu; Hui Lei 002; Yongtang Shi; Yiqiao Wang 002 (Discret. Appl. Math., 2024)

On the order of antipodal covers. - Jianfeng Wang; Wenqian Zhang; Yiqiao Wang 002; Zoran Stanic (J. Graph Theory, 2024)

Acyclic choosability of IC-planar graphs. - Ze Hu; Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2025)

Strict neighbor-distinguishing index of outerplanar graphs. - Weifan Wang 001; Lina Zheng; Jing Gu; Yiqiao Wang 002; Jingjing Huo (Discret. Appl. Math., 2025)

The 6-degeneracy of 1-planar graphs. - Qingqin Wu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2025)

The saturation number of C6. - Yongxin Lan; Yongtang Shi; Yiqiao Wang 002; Junxue Zhang 002 (Discret. Math., 2025)

An identifying operation on a 1-planar graph with an application to acyclic coloring. - Qiuyue Tan; Haizhen Qiu; Yiqiao Wang 002; Kan Wang (Appl. Math. Comput., 2026)