On the colorings of outerplanar graphs. - Weifan Wang 001 (Discret. Math., 1995)

On the vertex face total chromatic number of planar graphs. - Weifan Wang 001; Jiazhuang Liu (J. Graph Theory, 1996)

Edge-face chromatic number of plane graphs with high maximum degree. - Weifan Wang 001; Kemin Zhang 001 (Australas. J Comb., 1998)

Upper Bounds of Entire Chromatic Number of Plane Graphs. - Weifan Wang 001 (Eur. J. Comb., 1999)

The 4-choosability of planar graphs without 6-cycles. - Weifan Wang 001; Ko-Wei Lih (Australas. J Comb., 2001)

A note on list improper coloring planar graphs. - Ko-Wei Lih; Zengmin Song; Wei-Fan Wang 001; Kemin Zhang 001 (Appl. Math. Lett., 2001)

Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles. - Weifan Wang 001; Ko-Wei Lih (Comb. Probab. Comput., 2001)

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. - Wei-Fan Wang 001; Ko-Wei Lih (Eur. J. Comb., 2001)

Choosability and edge choosability of planar graphs without five cycles. - Wei-Fan Wang 001; Ko-Wei Lih (Appl. Math. Lett., 2002)

Edge-pancyclicity of coupled graphs. - Ko-Wei Lih; Zengmin Song; Wei-Fan Wang 001; Kemin Zhang 001 (Discret. Appl. Math., 2002)

A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. - Wei-Fan Wang 001; Ko-Wei Lih (Discret. Math., 2002)

Equitable Total Coloring of Graphs with Maximum Degree 3. - Wei-Fan Wang 001 (Graphs Comb., 2002)

Edge-partitions of planar graphs and their game coloring numbers. - Wenjie He; Xiaoling Hou; Ko-Wei Lih; Jiating Shao; Weifan Wang 001; Xuding Zhu (J. Graph Theory, 2002)

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. - Wei-Fan Wang 001; Ko-Wei Lih (SIAM J. Discret. Math., 2002)

Relaxed game chromatic number of graphs. - Chun-Yen Chou; Wei-Fan Wang 001; Xuding Zhu (Discret. Math., 2003)

Coloring the square of a K4-minor free graph. - Ko-Wei Lih; Wei-Fan Wang 001; Xuding Zhu (Discret. Math., 2003)

The Linear 2-Arboricity of Planar Graphs. - Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang 001 (Graphs Comb., 2003)

Labeling Planar Graphs with Conditions on Girth and Distance Two. - Wei-Fan Wang 001; Ko-Wei Lih (SIAM J. Discret. Math., 2003)

The Linear 2-Arboricity of Outerplanar Graphs. - Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang 001 (Ars Comb., 2004)

Vertex-pancyclicity of edge-face-total graphs. - Wei-Fan Wang 001 (Discret. Appl. Math., 2004)

The edge-face choosability of plane graphs. - Wei-Fan Wang 001; Ko-Wei Lih (Eur. J. Comb., 2004)

List Coloring Halin Graphs. - Wei-Fan Wang 001; Ko-Wei Lih (Ars Comb., 2005)

The L(2, 1)-labelling of trees. - Wei-Fan Wang 001 (Discret. Appl. Math., 2006)

Some sufficient conditions for a planar graph of maximum degree six to be Class 1. - Yuehua Bu; Weifan Wang 001 (Discret. Math., 2006)

Bordeaux 3-color conjecture and 3-choosability. - Mickaël Montassier; André Raspaud; Weifan Wang 001 (Discret. Math., 2006)

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers. - Wei-Fan Wang 001 (Discret. Math., 2006)

The 2-dipath chromatic number of Halin graphs. - Min Chen 012; Weifan Wang 001 (Inf. Process. Lett., 2006)

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

(2, 1)-Total labelling of outerplanar graphs. - Dong Chen 012; Weifan Wang 001 (Discret. Appl. Math., 2007)

On 3-colorable planar graphs without prescribed cycles. - Weifan Wang 001; Min Chen 012 (Discret. Math., 2007)

On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. - Wei-Fan Wang 001; Ko-Wei Lih (Eur. J. Comb., 2007)

Three-coloring planar graphs without short cycles. - Min Chen 012; André Raspaud; Weifan Wang 001 (Inf. Process. Lett., 2007)

On 3-colorable planar graphs without cycles of four lengths. - Xiaofang Luo; Min Chen 012; Weifan Wang 001 (Inf. Process. Lett., 2007)

Acyclic 5-choosability of planar graphs without small cycles. - Mickaël Montassier; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2007)

Total chromatic number of planar graphs with maximum degree ten. - Weifan Wang 001 (J. Graph Theory, 2007)

A sufficient condition for a planar graph to be class 1. - Weifan Wang 001; Yongzhu Chen (Theor. Comput. Sci., 2007)

On 3-colorable planar graphs without short cycles. - Min Chen 012; Weifan Wang 001 (Appl. Math. Lett., 2008)

Note on Coloring the Square of an Outerplanar Graph. - Wei-Fan Wang 001; Ko-Wei Lih (Ars Comb., 2008)

Improper choosability of graphs of nonnegative characteristic. - Yongzhu Chen; Weiyi Zhu; Weifan Wang 001 (Comput. Math. Appl., 2008)

Labelling planar graphs without 4-cycles with a condition on distance two. - Weifan Wang 001; Leizhen Cai (Discret. Appl. Math., 2008)

Acyclic 5-choosability of planar graphs without 4-cycles. - Min Chen 012; Weifan Wang 001 (Discret. Math., 2008)

Diameters of uniform subset graphs. - Yongzhu Chen; Weifan Wang 001 (Discret. Math., 2008)

On the vertex-arboricity of planar graphs. - André Raspaud; Weifan Wang 001 (Eur. J. Comb., 2008)

A relaxation of Havel's 3-color problem. - Mickaël Montassier; André Raspaud; Weifan Wang 001; Yingqian Wang 001 (Inf. Process. Lett., 2008)

Coupled choosability of plane graphs. - Wei-Fan Wang 001; Ko-Wei Lih (J. Graph Theory, 2008)

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. - Lan Shen; Yingqian Wang 001; Wei-Fan Wang 001; Ko-Wei Lih (Appl. Math. Lett., 2009)

Injective coloring of planar graphs. - Yuehua Bu; Dong Chen 012; André Raspaud; Weifan Wang 001 (Discret. Appl. Math., 2009)

Edge choosability of planar graphs without 5-cycles with a chord. - Yongzhu Chen; Weiyi Zhu; Weifan Wang 001 (Discret. Math., 2009)

On (d, 1)-total numbers of graphs. - Ko-Wei Lih; Daphne Der-Fen Liu; Wei-Fan Wang 001 (Discret. Math., 2009)

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. - Huajing Lu; Yingqian Wang 001; Weifan Wang 001; Yuehua Bu; Mickaël Montassier; André Raspaud (Discret. Math., 2009)

Linear coloring of planar graphs with large girth. - André Raspaud; Weifan Wang 001 (Discret. Math., 2009)

The edge-face coloring of graphs embedded in a surface of characteristic zero. - Weifan Wang 001 (Discret. Math., 2009)

(2, 1)-Total labelling of trees with sparse vertices of maximum degree. - Jing Huang; Haina Sun; Weifan Wang 001; Dong Chen 012 (Inf. Process. Lett., 2009)

(2, 1)-Total number of trees with maximum degree three. - Weifan Wang 001; Dong Chen 012 (Inf. Process. Lett., 2009)

Star coloring of sparse graphs. - Yuehua Bu; Daniel W. Cranston; Mickaël Montassier; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2009)

Planar graphs without 4-cycles are acyclically 6-choosable. - Weifan Wang 001; Min Chen 012 (J. Graph Theory, 2009)

The Surviving Rate of a Graph for the Firefighter Problem. - Leizhen Cai; Weifan Wang 001 (SIAM J. Discret. Math., 2009)

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)

Choosability of toroidal graphs without short cycles. - Leizhen Cai; Weifan Wang 001; Xuding Zhu (J. Graph Theory, 2010)

The surviving rate of an infected network. - Weifan Wang 001; Stephen Finbow; Ping Wang 023 (Theor. Comput. Sci., 2010)

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

Acyclic chromatic indices of planar graphs with large girth. - Weifan Wang 001; Qiaojun Shu; Kan Wang; Ping Wang 023 (Discret. Appl. Math., 2011)

Upper bounds on the linear chromatic number of a graph. - Chao Li; Weifan Wang 001; André Raspaud (Discret. Math., 2011)

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. - Yuehua Bu; Ko-Wei Lih; Weifan Wang 001 (Discuss. Math. Graph Theory, 2011)

8-star-choosability of a graph with maximum average degree less than 3. - Min Chen 012; André Raspaud; Weifan Wang 001 (Discret. Math. Theor. Comput. Sci., 2011)

Entire colouring of plane graphs. - Weifan Wang 001; Xuding Zhu (J. Comb. Theory B, 2011)

The surviving rate of an outerplanar graph for the firefighter problem. - Weifan Wang 001; Xubin Yue; Xuding Zhu (Theor. Comput. Sci., 2011)

A Note on General Neighbor-Distinguishing Total Coloring of Graphs. - Danjun Huang; Weifan Wang 001; Jianxing Yin (Ars Comb., 2012)

Fault tolerant path-embedding in locally twisted cubes. - Caiyue Ye; Meijie Ma; Weifan Wang 001 (Ars Comb., 2012)

Planar Graphs of Maximum Degree Six without 7-cycles are Class One. - Danjun Huang; Weifan Wang 001 (Electron. J. Comb., 2012)

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)

On the vertex-arboricity of planar graphs without 7-cycles. - Danjun Huang; Wai Chee Shiu; Weifan Wang 001 (Discret. Math., 2012)

A note on the adjacent vertex distinguishing total chromatic number of graphs. - Danjun Huang; Weifan Wang 001; Chengchao Yan (Discret. Math., 2012)

An improved bound on parity vertex colourings of outerplane graphs. - Weifan Wang 001; Stephen Finbow; Ping Wang 023 (Discret. Math., 2012)

Vertex-arboricity of planar graphs without intersecting triangles. - Min Chen 012; André Raspaud; Weifan Wang 001 (Eur. J. Comb., 2012)

Some results on the injective chromatic number of graphs. - Min Chen 012; Gena Hahn; André Raspaud; Weifan Wang 001 (J. Comb. Optim., 2012)

Acyclic chromatic indices of planar graphs with girth at least five. - Qiaojun Shu; Weifan Wang 001 (J. Comb. Optim., 2012)

On backbone coloring of graphs. - Weifan Wang 001; Yuehua Bu; Mickaël Montassier; André Raspaud (J. Comb. Optim., 2012)

The surviving rate of planar graphs. - Jiangxu Kong; Weifan Wang 001; Xuding Zhu (Theor. Comput. Sci., 2012)

The 2-surviving rate of planar graphs without 4-cycles. - Weifan Wang 001; Jiangxu Kong; Lianzhu Zhang (Theor. Comput. Sci., 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)

Vertex arboricity of planar graphs without chordal 6-cycles. - Danjun Huang; Weifan Wang 001 (Int. J. Comput. Math., 2013)

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

6-Star-Coloring of Subcubic Graphs. - Min Chen 012; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2013)

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

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. - Lianzhu Zhang; Weifan Wang 001; Ko-Wei Lih (Discret. Appl. Math., 2014)

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

The surviving rate of digraphs. - Jiangxu Kong; Lianzhu Zhang; Wei-Fan Wang 001 (Discret. Math., 2014)

Structural properties and surviving rate of planar graphs. - Jiangxu Kong; Lianzhu Zhang; Wei-Fan Wang 001 (Discret. Math. Algorithms Appl., 2014)

Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. - Min Chen 012; André Raspaud; Weifan Wang 001 (Graphs Comb., 2014)

Star list chromatic number of planar subcubic graphs. - Min Chen 012; André Raspaud; Weifan Wang 001 (J. Comb. Optim., 2014)

A lower bound of the surviving rate of a planar graph with girth at least seven. - Weifan Wang 001; Stephen Finbow; Ping Wang 023 (J. Comb. Optim., 2014)

The adjacent vertex distinguishing total coloring of planar graphs. - Weifan Wang 001; Danjun Huang (J. Comb. Optim., 2014)

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. - Chengchao Yan; Danjun Huang; Dong Chen 012; Weifan Wang 001 (J. Comb. Optim., 2014)

On Neighbor-Distinguishing Index of Planar Graphs. - Mirko Hornák; Danjun Huang; Weifan Wang 001 (J. Graph Theory, 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)

The 2-surviving rate of planar graphs without 6-cycles. - Weifan Wang 001; Stephen Finbow; Jiangxu Kong (Theor. Comput. Sci., 2014)

Legally ( varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. - Danjun Huang; Ko-Wei Lih; Wei-Fan Wang 001 (COCOA, 2015)

Full Orientability of the Square of a Cycle. - Fengwei Xu; Wei-Fan Wang 001; Ko-Wei Lih (Ars Comb., 2015)

The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures. - Wei Gao 012; Weifan Wang 001 (Comput. Math. Methods Medicine, 2015)

(2, 1)-total labeling of trees with large maximum degree. - Dong Chen 012; Wai Chee Shiu; Qiaojun Shu; Pak Kiu Sun; Weifan Wang 001 (Discret. Appl. Math., 2015)

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

Adjacent vertex distinguishing indices of planar graphs without 3-cycles. - Danjun Huang; Zhengke Miao; Weifan Wang 001 (Discret. Math., 2015)

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

A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. - Wei-Fan Wang 001; Danjun Huang (SIAM J. Discret. Math., 2015)

List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. - Min Chen 012; Li Huang; Weifan Wang 001 (Discret. Math., 2016)

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

Rainbow cliques in edge-colored graphs. - Chuandong Xu; Xiaoxue Hu; Weifan Wang 001; Shenggui Zhang (Eur. J. Comb., 2016)

A (3, 1) ∗-choosable theorem on planar graphs. - Min Chen 012; André Raspaud; Weifan Wang 001 (J. Comb. Optim., 2016)

A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. - Zhengke Miao; Qiaojun Shu; Weifan Wang 001; Dong Chen 012 (J. Comb. Optim., 2016)

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

The 2-surviving rate of planar graphs without 5-cycles. - Tingting Wu; Jiangxu Kong; Wei-Fan Wang 001 (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)

Neighbor Sum Distinguishing Index of Subcubic Graphs. - Jingjing Huo; Weifan Wang 001; Chuandong Xu (Graphs Comb., 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)

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)

On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. - Min Chen 012; Weiqiang Yu; Weifan Wang 001 (Appl. Math. Comput., 2018)

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

The neighbor expanded sum distinguishing index of Halin graphs. - Jingjing Huo; Wai Chee Shiu; Weifan Wang 001 (Ars Comb., 2018)

Planar graphs without chordal 6-cycles are 4-choosable. - Daiqiang Hu; Danjun Huang; Weifan Wang 001; Jian-Liang Wu 001 (Discret. Appl. Math., 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)

Planar graphs with maximum degree 4 are strongly 19-edge-colorable. - Ying Wang; Wai Chee Shiu; Weifan Wang 001; Min Chen 012 (Discret. Math., 2018)

2-distance vertex-distinguishing total coloring of graphs. - Yafang Hu; Weifan Wang 001 (Discret. Math. Algorithms Appl., 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)

Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion. - Wei Gao 012; Weifan Wang 001 (Int. J. Comput. Math., 2018)

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

2-Distance vertex-distinguishing index of subcubic graphs. - Victor Loumngam Kamga; Weifan Wang 001; Ying Wang; Min Chen 012 (J. Comb. Optim., 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)

Choosability with separation of planar graphs without prescribed cycles. - Min Chen 012; Yingying Fan; André Raspaud; Wai Chee Shiu; Weifan Wang 001 (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)

Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles. - Danjun Huang; Xiaoxiu Zhang; Weifan Wang 001; Stephen Finbow (Discret. Math. Algorithms Appl., 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 of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. - Yiqiao Wang 002; Xiaoxue Hu; Weifan Wang 001; Ko-Wei Lih (J. Graph Theory, 2020)

A note on strong edge choosability of toroidal subcubic graphs. - Xinhong Pang; Jingjing Huo; Min Chen 012; Weifan Wang 001 (Australas. J Comb., 2021)

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)

Acyclic Edge Coloring of Chordal Graphs with Bounded Degree. - Yulai Ma; Yongtang Shi; Weifan Wang 001 (Graphs Comb., 2021)

Tight bounds for the existence of path factors in network vulnerability parameter settings. - Wei Gao 012; Weifan Wang 001; Yaojun Chen (Int. J. Intell. Syst., 2021)

Tight binding number bound for P≥3-factor uniform graphs. - Wei Gao 012; Weifan Wang 001 (Inf. Process. Lett., 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)

On the Zero Forcing Number and Spectral Radius of Graphs. - Wenqian Zhang; Jianfeng Wang; Weifan Wang 001; Shengjin Ji (Electron. J. Comb., 2022)

Tight isolated toughness bound for fractional (k, n)-critical graphs. - Wei Gao 012; Weifan Wang 001; Yaojun Chen (Discret. Appl. Math., 2022)

A sufficient condition for a planar graph to be (F, F2)-partitionable. - Runrun Liu; Weifan Wang 001 (Discret. Appl. Math., 2022)

Vertex-arboricity of toroidal graphs without K5- and 6-cycles. - Aina Zhu; Dong Chen 012; Min Chen 012; Weifan Wang 001 (Discret. Appl. Math., 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)

On 3-flow-critical graphs. - Jiaao Li; Yulai Ma; Yongtang Shi; Weifan Wang 001; Yezhou Wu (Eur. J. Comb., 2022)

Fuzzy fractional factors in fuzzy graphs. - Wei Gao 012; Weifan Wang 001; Lina Zheng (Int. J. Intell. Syst., 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)

Nowhere-zero 3-flows in toroidal graphs. - Jiaao Li; Yulai Ma; Zhengke Miao; Yongtang Shi; Weifan Wang 001; Cun-Quan Zhang (J. Comb. Theory B, 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)

An (F3, F5)-partition of planar graphs with girth at least 5. - Min Chen 012; André Raspaud; Weifan Wang 001; Weiqiang Yu (Discret. Math., 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)

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

Neighbor-distinguishing indices of planar graphs with maximum degree ten. - Danjun Huang; Hongfeng Cai; Weifan Wang 001; Jingjing Huo (Discret. Appl. Math., 2023)

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

2-Distance choosability of planar graphs with a restriction for maximum degree. - Jiahao Yu; Min Chen 012; Weifan Wang 001 (Appl. Math. Comput., 2023)

IC-planar graphs are odd-10-colorable. - Chenran Pan; Weifan Wang 001; Runrun Liu (Appl. Math. Comput., 2023)

1-planar graphs are odd 13-colorable. - Runrun Liu; Weifan Wang 001; Gexin Yu (Discret. Math., 2023)

Isolated toughness and fractional (a,b,n)-critical graphs. - Wei Gao 012; Weifan Wang 001; Yaojun Chen (Connect. Sci., 2023)

Partitioning planar graphs into bounded degree forests. - Yang Wang 107; Jiali Wang; Weifan Wang 001; Jiangxu Kong (Appl. Math. Comput., 2024)

A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable. - Ganchao Zhang; Min Chen 012; Weifan Wang 001 (Appl. Math. Comput., 2024)

Nowhere-Zero 3-Flows in Signed Planar Graphs. - Jiaao Li; Yulai Ma; Zhengke Miao; Yongtang Shi; Wei-Fan Wang 001 (Electron. J. Comb., 2024)

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)

Spectral extrema of 1-planar graphs. - Wenqian Zhang; Jianfeng Wang; Weifan Wang 001 (Discret. Math., 2024)

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

Proper conflict-free 6-coloring of planar graphs without short cycles. - Yunlong Wang; Weifan Wang 001; Runrun Liu (Appl. Math. Comput., 2025)

1-Planar graphs with no 5-cycles are 5-degenerate. - Qingqin Wu; Weifan Wang 001; Jiangxu Kong (Appl. Math. Comput., 2025)

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

Dynamic coloring of IC-planar graphs. - Xiaoxue Hu; Jiangxu Kong; Weifan Wang 001; Wanshun Yang (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 strict neighbor-distinguishing index of simple graphs with maximum degree five. - Danjun Huang; Jiayan Wang; Weifan Wang 001; Puning Jing (Ars Comb., 2025)