Wei-Fan Wang

发表

The Surviving Rate of a Graph for the Firefighter Problem

Leizhen Cai, Wei-Fan Wang, L. Cai, 2009, SIAM J. Discret. Math..

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2013, Discret. Appl. Math..

Acyclic 5-choosability of planar graphs without small cycles

André Raspaud, Mickaël Montassier, Wei-Fan Wang, 2007, J. Graph Theory.

The edge-face coloring of graphs embedded in a surface of characteristic zero

Wei-Fan Wang, 2009, Discret. Math..

Total chromatic number of planar graphs with maximum degree ten

Wei-Fan Wang, Wei-Fan Wang, 2007, J. Graph Theory.

Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time

Ko-Wei Lih, Wei-Fan Wang, Danjun Huang, 2015, COCOA.

Entire colouring of plane graphs

Xuding Zhu, Wei-Fan Wang, 2011, J. Comb. Theory, Ser. B.

The surviving rate of an outerplanar graph for the firefighter problem

Xuding Zhu, Wei-Fan Wang, Xubin Yue, 2011, Theor. Comput. Sci..

Labeling Planar Graphs with Conditions on Girth and Distance Two

Ko-Wei Lih, Wei-Fan Wang, Ko-Wei Lih, 2004, SIAM J. Discret. Math..

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs

Ko-Wei Lih, Wei-Fan Wang, Ko-Wei Lih, 2001, Eur. J. Comb..

Acyclic 5-choosability of planar graphs without 4-cycles

Min Chen, Wei-Fan Wang, 2008, Discret. Math..

Vertex arboricity of planar graphs without chordal 6-cycles

Wei-Fan Wang, Danjun Huang, 2013, Int. J. Comput. Math..

A note on the linear 2-arboricity of planar graphs

Wei-Fan Wang, Yiqiao Wang, Xiaoxue Hu, 2017, Discret. Math..

A note on the list vertex arboricity of toroidal graphs

Min Chen, Wei-Fan Wang, Yiqiao Wang, 2018, Discret. Math..

Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable

Wei-Fan Wang, Yiqiao Wang, Danjun Huang, 2019, J. Comb. Optim..

Fault tolerant path-embedding in locally twisted cubes

Meijie Ma, Wei-Fan Wang, Caiyue Ye, 2012, Ars Comb..

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Ko-Wei Lih, Wei-Fan Wang, 2002, SIAM J. Discret. Math..

An improved bound on parity vertex colourings of outerplane graphs

Ping Wang, Wei-Fan Wang, Stephen Finbow, 2012, Discret. Math..

Choosability of toroidal graphs without short cycles

Xuding Zhu, Leizhen Cai, Wei-Fan Wang, 2010, J. Graph Theory.

On 3-colorable planar graphs without short cycles

Min Chen, Wei-Fan Wang, 2008, Appl. Math. Lett..

Every 4-regular graph is acyclically edge-6-colorable pdf

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2012, ArXiv.

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six

Ko-Wei Lih, Wei-Fan Wang, Yuehua Bu, 2011, Discuss. Math. Graph Theory.

The 4-choosability of planar graphs without 6-cycles

Ko-Wei Lih, Wei-Fan Wang, 2001, Australas. J Comb..

Some results on the injective chromatic number of graphs

Min Chen, André Raspaud, Gena Hahn, 2012, J. Comb. Optim..

Rainbow cliques in edge-colored graphs

Shenggui Zhang, Wei-Fan Wang, Xiaoxue Hu, 2016, Eur. J. Comb..

List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles

Min Chen, Wei-Fan Wang, Li Huang, 2016, Discret. Math..

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

Ko-Wei Lih, Yingqian Wang, Wei-Fan Wang, 2009, Appl. Math. Lett..

(2, 1)-Total number of trees with maximum degree three

Wei-Fan Wang, Dong Chen, 2009, Inf. Process. Lett..

On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree

Min Chen, Wei-Fan Wang, Weiqiang Yu, 2018, Appl. Math. Comput..

Acyclic list edge coloring of outerplanar graphs

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2013, Discret. Math..

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs

Ding-Zhu Du, Wei-Fan Wang, Yiqiao Wang, 2016, J. Glob. Optim..

The 2-surviving rate of planar graphs without 4-cycles

Wei-Fan Wang, Lianzhu Zhang, Jiangxu Kong, 2012, Theor. Comput. Sci..

Upper Bounds of Entire Chromatic Number of Plane Graphs

Wei-Fan Wang, 1999, Eur. J. Comb..

The L(2, 1)-labelling of trees

Wei-Fan Wang, 2006, Discret. Appl. Math..

Star edge-coloring of graphs with maximum degree four

Ying Wang, Wei-Fan Wang, Yiqiao Wang, 2019, Appl. Math. Comput..

The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs

Wei-Fan Wang, Danjun Huang, Chengchao Yan, 2010, 2010 4th International Conference on Bioinformatics and Biomedical Engineering.

A sufficient condition for a tree to be $$(\Delta +1)$$(Δ+1)-$$(2,1)$$(2,1)-totally labelable

Wei-Fan Wang, Qiaojun Shu, Dong Chen, 2016, J. Comb. Optim..

Linear coloring of planar graphs with large girth

André Raspaud, Wei-Fan Wang, 2009, Discret. Math..

(2, 1)-total Labeling of Trees with Large Maximum Degree

Wei-Fan Wang, Qiaojun Shu, Wai Chee Shiu, 2015, Discret. Appl. Math..

The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures

Wei Gao, Wei-Fan Wang, Wei Gao, 2015, Comput. Math. Methods Medicine.

Edge-partition and star chromatic index

Ying Wang, Wei-Fan Wang, Yiqiao Wang, 2018, Appl. Math. Comput..

Relaxed game chromatic number of graphs

Xuding Zhu, Wei-Fan Wang, Chun-Yen Chou, 2003, Discret. Math..

6-Star-Coloring of Subcubic Graphs

Min Chen, André Raspaud, Wei-Fan Wang, 2013, J. Graph Theory.

The adjacent vertex distinguishing total coloring of planar graphs

Wei-Fan Wang, Danjun Huang, 2014, J. Comb. Optim..

On the vertex-arboricity of planar graphs

André Raspaud, Wei-Fan Wang, 2008, Eur. J. Comb..

A sufficient condition for a planar graph to be class 1

Wei-Fan Wang, Yongzhu Chen, 2007, Theor. Comput. Sci..

Some sufficient conditions for a planar graph of maximum degree six to be Class 1

Wei-Fan Wang, Yuehua Bu, Weifan Wang, 2006, Discret. Math..

Edge‐partitions of planar graphs and their game coloring numbers

Xuding Zhu, Ko-Wei Lih, Xiaoling Hou, 2002, J. Graph Theory.

Acyclic chromatic indices of planar graphs with girth at least five

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2010, Journal of Combinatorial Optimization.

Neighbor-sum-distinguishing edge choosability of subcubic graphs

Wei-Fan Wang, Yiqiao Wang, Jingjing Huo, 2017, J. Comb. Optim..

A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs

Ko-Wei Lih, Wei-Fan Wang, 2002, Discret. Math..

Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable

Wei-Fan Wang, Yiqiao Wang, Xiaoxue Hu, 2014, SIAM J. Discret. Math..

The surviving rate of digraphs

Wei-Fan Wang, Lianzhu Zhang, Jiangxu Kong, 2014, Discret. Math..

Choosability and edge choosability of planar graphs without five cycles

Ko-Wei Lih, Wei-Fan Wang, 2002, Appl. Math. Lett..

On (d, 1)-total numbers of graphs

Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang, 2009, Discret. Math..

List Coloring Halin Graphs

Ko-Wei Lih, Wei-Fan Wang, 2005, Ars Comb..

Labelling planar graphs without 4-cycles with a condition on distance two

Leizhen Cai, Wei-Fan Wang, 2008, Discret. Appl. Math..

Planar graphs without chordal 5-cycles are 2-good

Wei-Fan Wang, Yiqiao Wang, Tingting Wu, 2018, J. Comb. Optim..

Neighbor Sum Distinguishing Index of Subcubic Graphs

Wei-Fan Wang, Jingjing Huo, Chuandong Xu, 2017, Graphs Comb..

Edge choosability of planar graphs without 5-cycles with a chord

Wei-Fan Wang, Weiyi Zhu, Yongzhu Chen, 2009, Discret. Math..

Vertex-pancyclicity of edge-face-total graphs

Wei-Fan Wang, 2004, Discret. Appl. Math..

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers

Wei-Fan Wang, 2006, Discret. Math..

The 2-surviving rate of planar graphs without 5-cycles

Wei-Fan Wang, Tingting Wu, Jiangxu Kong, 2016, J. Comb. Optim..

Star coloring of sparse graphs

André Raspaud, Daniel W. Cranston, Mickaël Montassier, 2009, J. Graph Theory.

2-distance Vertex-distinguishing Total Coloring of Graphs

Wei-Fan Wang, Yafang Hu, 2018, Discret. Math. Algorithms Appl..

Equitable Total Coloring of Graphs with Maximum Degree 3

Wei-Fan Wang, 2002, Graphs Comb..

Full Orientability of the Square of a Cycle

Ko-Wei Lih, Wei-Fan Wang, Fengwei Xu, 2015, Ars Comb..

Upper bounds on the linear chromatic number of a graph

André Raspaud, Chao Li, Wei-Fan Wang, 2011, Discret. Math..

Diameters of uniform subset graphs

Wei-Fan Wang, Yongzhu Chen, Weifan Wang, 2008, Discret. Math..

A Note on General Neighbor-Distinguishing Total Coloring of Graphs

Wei-Fan Wang, Jianxing Yin, Danjun Huang, 2012, Ars Comb..

A lower bound of the surviving rate of a planar graph with girth at least seven

Ping Wang, Wei-Fan Wang, Stephen Finbow, 2014, J. Comb. Optim..

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

Ko-Wei Lih, Wei-Fan Wang, Lianzhu Zhang, 2012, Discret. Appl. Math..

The Linear 2-Arboricity of Planar Graphs

Ko-Wei Lih, Wei-Fan Wang, Li-Da Tong, 2003, Graphs Comb..

On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability

Ko-Wei Lih, Wei-Fan Wang, 2007, Eur. J. Comb..

A relaxation of Havel's 3-color problem

André Raspaud, Yingqian Wang, Mickaël Montassier, 2008, Inf. Process. Lett..

Note on Coloring the Square of an Outerplanar Graph

Ko-Wei Lih, Wei-Fan Wang, 2008, Ars Comb..

A note on list improper coloring planar graphs

Ko-Wei Lih, Zengmin Song, Kemin Zhang, 2001, Appl. Math. Lett..

Adjacent vertex-distinguishing edge colorings of K4-minor free graphs

Wei-Fan Wang, Yiqiao Wang, 2011, Appl. Math. Lett..

The edge-face choosability of plane graphs

Ko-Wei Lih, Wei-Fan Wang, 2004, Eur. J. Comb..

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

Wei-Fan Wang, Yiqiao Wang, Weifan Wang, 2010, J. Comb. Optim..

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic

Ping Wang, Wei-Fan Wang, Yiqiao Wang, 2018, Graphs Comb..

Coloring the square of a K4-minor free graph

Xuding Zhu, Ko-Wei Lih, Wei-Fan Wang, 2003, Discret. Math..

Planar graphs without 4-cycles are acyclically 6-choosable

Min Chen, Wei-Fan Wang, 2009, J. Graph Theory.

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

André Raspaud, Yingqian Wang, Mickaël Montassier, 2009, Discret. Math..

Equitable total-coloring of subcubic graphs

Zhao Zhang, Wei-Fan Wang, Yiqiao Wang, 2015, Discret. Appl. Math..

Adjacent vertex distinguishing indices of planar graphs without 3-cycles

Wei-Fan Wang, Zhengke Miao, Danjun Huang, 2015, Discret. Math..

A new upper bound on the acyclic chromatic indices of planar graphs

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2012, Eur. J. Comb..

Linear Coloring of Planar Graphs Without 4-Cycles

Wei-Fan Wang, Yiqiao Wang, 2013, Graphs Comb..

The entire choosability of plane graphs

Wei-Fan Wang, Yiqiao Wang, Tingting Wu, 2016, J. Comb. Optim..

Improper choosability of graphs of nonnegative characteristic

Wei-Fan Wang, Weiyi Zhu, Yongzhu Chen, 2008, Comput. Math. Appl..

A $$(3,1)^{*}$$(3,1)∗-choosable theorem on planar graphs

Min Chen, André Raspaud, Wei-Fan Wang, 2016, J. Comb. Optim..

On the vertex-arboricity of planar graphs without 7-cycles

Wei-Fan Wang, Wai Chee Shiu, Danjun Huang, 2012, Discret. Math..

Acyclic chromatic indices of planar graphs with girth at least five

Wei-Fan Wang, Qiaojun Shu, 2012, J. Comb. Optim..

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

Wei-Fan Wang, Dong Chen, Danjun Huang, 2014, J. Comb. Optim..

Acyclic chromatic indices of planar graphs with large girth

Ping Wang, Wei-Fan Wang, Qiaojun Shu, 2011, Discret. Appl. Math..

Bordeaux 3-color conjecture and 3-choosability

André Raspaud, Mickaël Montassier, Wei-Fan Wang, 2006, Discret. Math..

On the colorings of outerplanar graphs

Wei-Fan Wang, 1995, Discret. Math..

On 3-colorable planar graphs without prescribed cycles

Min Chen, Wei-Fan Wang, 2007, Discret. Math..

The entire chromatic number of graphs embedded on the torus with large maximum degree

Ping Wang, Wei-Fan Wang, Yiqiao Wang, 2017, Theor. Comput. Sci..

The edge-face choosability of plane graphs with maximum degree at least 9

Wei-Fan Wang, Yiqiao Wang, Xiaoxue Hu, 2014, Discret. Math..

Planar Graphs of Maximum Degree Six without 7-cycles are Class One

Wei-Fan Wang, Danjun Huang, 2012, Electron. J. Comb..

The chromatic number of the square of a Halin graph with maximum degree five is six

Wei-Fan Wang, Yiqiao Wang, Xiaoxue Hu, 2017, Ars Comb..

On 3-colorable planar graphs without cycles of four lengths

Min Chen, Wei-Fan Wang, Xiaofang Luo, 2007, Inf. Process. Lett..

The 2-dipath chromatic number of Halin graphs

Min Chen, Wei-Fan Wang, Weifan Wang, 2006, Inf. Process. Lett..

Edge-pancyclicity of coupled graphs

Ko-Wei Lih, Zengmin Song, Kemin Zhang, 2002, Discret. Appl. Math..

Star list chromatic number of planar subcubic graphs

Min Chen, André Raspaud, Wei-Fan Wang, 2014, J. Comb. Optim..

Planar graphs with maximum degree 4 are strongly 19-edge-colorable

Min Chen, Ying Wang, Wei-Fan Wang, 2018, Discret. Math..

Vertex-arboricity of planar graphs without intersecting triangles

Min Chen, André Raspaud, Wei-Fan Wang, 2012, Eur. J. Comb..

Plane graphs with maximum degree 9 are entirely 11-choosable

Wei-Fan Wang, Yiqiao Wang, Wai Chee Shiu, 2016, Discret. Math..

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13

Wei-Fan Wang, Yiqiao Wang, Jingjing Huo, 2018, Discret. Math..

Choosability with separation of planar graphs without prescribed cycles

André Raspaud, Wei-Fan Wang, Wai Chee Shiu, 2020, Appl. Math. Comput..

Edge-face chromatic number of plane graphs with high maximum degree

Kemin Zhang, Wei-Fan Wang, 1998, Australas. J Comb..

The neighbor expanded sum distinguishing index of Halin graphs

Wei-Fan Wang, Wai Chee Shiu, Jingjing Huo, 2018, Ars Comb..

The Linear 2-Arboricity of Outerplanar Graphs

Ko-Wei Lih, Wei-Fan Wang, Li-Da Tong, 2004, Ars Comb..

Structural properties and surviving rate of planar graphs

Wei-Fan Wang, Lianzhu Zhang, Jiangxu Kong, 2014, Discret. Math. Algorithms Appl..

A new sufficient condition for a tree T to have the (2, 1)-total number $$\Delta +1$$Δ+1

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2017, J. Comb. Optim..

Adjacent vertex distinguishing total colorings of outerplanar graphs

Wei-Fan Wang, Yiqiao Wang, Weifan Wang, 2010, J. Comb. Optim..

(2, 1)-Total labelling of outerplanar graphs

Wei-Fan Wang, Dong Chen, 2007, Discret. Appl. Math..

Acyclic edge coloring of planar graphs without 4-cycles

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2012, Journal of Combinatorial Optimization.

8-star-choosability of a Graph with Maximum Average Degree Less than 3

Min Chen, André Raspaud, Wei-Fan Wang, 2011, Discret. Math. Theor. Comput. Sci..

Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion

Wei Gao, Wei-Fan Wang, Wei Gao, 2018, Int. J. Comput. Math..

2-Distance vertex-distinguishing index of subcubic graphs

Min Chen, Ying Wang, Wei-Fan Wang, 2018, J. Comb. Optim..

Some bounds on the neighbor-distinguishing index of graphs

Wei-Fan Wang, Yiqiao Wang, Jingjing Huo, 2015, Discret. Math..

Planar graphs without chordal 6-cycles are 4-choosable

Wei-Fan Wang, Jian-Liang Wu, Danjun Huang, 2018, Discret. Appl. Math..

Three-coloring planar graphs without short cycles

Min Chen, André Raspaud, Wei-Fan Wang, 2007, Inf. Process. Lett..

On the vertex face total chromatic number of planar graphs

Wei-Fan Wang, Jiazhuang Liu, 1996, J. Graph Theory.

Acyclic edge coloring of planar graphs without 4-cycles

Wei-Fan Wang, Yiqiao Wang, Qiaojun Shu, 2013, J. Comb. Optim..

Injective coloring of planar graphs

André Raspaud, Dong Chen, Wei-Fan Wang, 2009, Discret. Appl. Math..

L(p, q)-labelling of K4-minor free graphs

Wei-Fan Wang, Yiqiao Wang, 2006, Inf. Process. Lett..

On backbone coloring of graphs

André Raspaud, Mickaël Montassier, Wei-Fan Wang, 2012, J. Comb. Optim..

The surviving rate of planar graphs

Xuding Zhu, Wei-Fan Wang, Jiangxu Kong, 2012, Theor. Comput. Sci..

Strong chromatic index of K4-minor free graphs

Ping Wang, Wei-Fan Wang, Yiqiao Wang, 2018, Inf. Process. Lett..

On Neighbor-Distinguishing Index of Planar Graphs

Mirko Hornák, Wei-Fan Wang, Danjun Huang, 2014, J. Graph Theory.

A sufficient condition for planar graphs to be (3, 1)-choosable

Min Chen, Wei-Fan Wang, Yiqiao Wang, 2017, Journal of Combinatorial Optimization.