Weifan Wang

159 papers C 1Journal 158
YearRankTypeTitle / Venue / Authors
2026 J jnl
A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable.
Discret. Appl. Math.
Ganchao Zhang, Min Chen, Danjun Huang, Weifan Wang
2025 J jnl
1-Planar graphs with no 5-cycles are 5-degenerate.
Appl. Math. Comput.
Qingqin Wu, Weifan Wang, Jiangxu Kong
2025 J jnl
Acyclic choosability of IC-planar graphs.
Discret. Appl. Math.
Ze Hu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang
2025 J jnl
Dynamic coloring of IC-planar graphs.
Discret. Appl. Math.
Xiaoxue Hu, Jiangxu Kong, Weifan Wang, Wanshun Yang
2025 J jnl
Proper conflict-free 6-coloring of planar graphs without short cycles.
Appl. Math. Comput.
Yunlong Wang, Weifan Wang, Runrun Liu
2025 J jnl
Strict neighbor-distinguishing index of outerplanar graphs.
Discret. Appl. Math.
Weifan Wang, Lina Zheng, Jing Gu, Yiqiao Wang, Jingjing Huo
2025 J jnl
The 6-degeneracy of 1-planar graphs.
Discret. Appl. Math.
Qingqin Wu, Weifan Wang, Yiqiao Wang
2025 J jnl
The strict neighbor-distinguishing index of simple graphs with maximum degree five.
Ars Comb.
Danjun Huang, Jiayan Wang, Weifan Wang, Puning Jing
2024 J jnl
A note on the list vertex-arboricity of IC-planar graphs.
Discret. Math.
Yang Wang, Yiqiao Wang, Weifan Wang, Lina Zheng
2024 J jnl
A sufficient condition for a graph to be fractional (k,n)-critical.
Discret. Math.
Wei Gao, Yiqiao Wang, Weifan Wang
2024 J jnl
A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable.
Appl. Math. Comput.
Ganchao Zhang, Min Chen, Weifan Wang
2024 J jnl
Linear arboricity of 1-planar graphs.
Discuss. Math. Graph Theory
Weifan Wang, Juan Liu, Yiqiao Wang
2024 J jnl
Partitioning planar graphs into bounded degree forests.
Appl. Math. Comput.
Yang Wang, Jiali Wang, Weifan Wang, Jiangxu Kong
2024 J jnl
Spectral extrema of 1-planar graphs.
Discret. Math.
Wenqian Zhang, Jianfeng Wang, Weifan Wang
2023 J jnl
1-planar graphs are odd 13-colorable.
Discret. Math.
Runrun Liu, Weifan Wang, Gexin Yu
2023 J jnl
2-Distance choosability of planar graphs with a restriction for maximum degree.
Appl. Math. Comput.
Jiahao Yu, Min Chen, Weifan Wang
2023 J jnl
An (
Discret. Math.
Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu
2023 J jnl
IC-planar graphs are odd-10-colorable.
Appl. Math. Comput.
Chenran Pan, Weifan Wang, Runrun Liu
2023 J jnl
Isolated toughness and fractional (
Connect. Sci.
Wei Gao, Weifan Wang, Yaojun Chen
2023 J jnl
Neighbor-distinguishing indices of planar graphs with maximum degree ten.
Discret. Appl. Math.
Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo
2023 J jnl
Plane graphs of diameter two are 2-optimal.
Appl. Math. Comput.
Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang
2023 J jnl
Strict neighbor-distinguishing index of K4-minor-free graphs.
Discret. Appl. Math.
Jing Gu, Yiqiao Wang, Weifan Wang, Lina Zheng
2023 J jnl
The Difference of Zagreb Indices of Halin Graphs.
Axioms
Lina Zheng, Yiqiao Wang, Weifan Wang
2023 J jnl
The strong chromatic index of 1-planar graphs.
Discret. Math. Theor. Comput. Sci.
Yiqiao Wang, Ning Song, Jianfeng Wang, Weifan Wang
2022 J jnl
A sufficient condition for a planar graph to be (F, F2)-partitionable.
Discret. Appl. Math.
Runrun Liu, Weifan Wang
2022 J jnl
Fuzzy fractional factors in fuzzy graphs.
Int. J. Intell. Syst.
Wei Gao, Weifan Wang, Lina Zheng
2022 J jnl
Light edges in 1-planar graphs.
J. Graph Theory
Juan Liu, Yiqiao Wang, Weifan Wang
2022 J jnl
Nowhere-zero 3-flows in toroidal graphs.
J. Comb. Theory B
Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, Cun-Quan Zhang
2022 J jnl
On 3-flow-critical graphs.
Eur. J. Comb.
Jiaao Li, Yulai Ma, Yongtang Shi, Weifan Wang, Yezhou Wu
2022 J jnl
On the Zero Forcing Number and Spectral Radius of Graphs.
Electron. J. Comb.
Wenqian Zhang, Jianfeng Wang, Weifan Wang, Shengjin Ji
2022 J jnl
Star Chromatic Index of 1-Planar Graphs.
Symmetry
Yiqiao Wang, Juan Liu, Yongtang Shi, Weifan Wang
2022 J jnl
Strong Chromatic Index of Outerplanar Graphs.
Axioms
Ying Wang, Yiqiao Wang, Weifan Wang, Shuyu Cui
2022 J jnl
Structure and pancyclicity of maximal planar graphs with diameter two.
J. Comb. Optim.
Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du, Weifan Wang
2022 J jnl
Tight isolated toughness bound for fractional (k, n)-critical graphs.
Discret. Appl. Math.
Wei Gao, Weifan Wang, Yaojun Chen
2022 J jnl
Two sufficient conditions for a planar graph to be list vertex-2-arborable.
Discret. Math.
Yiqiao Wang, Yanping Yang, Danjun Huang, Weifan Wang
2022 J jnl
Vertex-arboricity of toroidal graphs without K5- and 6-cycles.
Discret. Appl. Math.
Aina Zhu, Dong Chen, Min Chen, Weifan Wang
2021 J jnl
A note on strong edge choosability of toroidal subcubic graphs.
Australas. J Comb.
Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang
2021 J jnl
Acyclic Edge Coloring of Chordal Graphs with Bounded Degree.
Graphs Comb.
Yulai Ma, Yongtang Shi, Weifan Wang
2021 J jnl
Entire coloring of 2-connected plane graphs.
Eur. J. Comb.
Weifan Wang, Xiaoxue Hu, Yiqiao Wang
2021 J jnl
Strict Neighbor-Distinguishing Index of Subcubic Graphs.
Graphs Comb.
Jing Gu, Weifan Wang, Yiqiao Wang, Ying Wang
2021 J jnl
Tight binding number bound for
Inf. Process. Lett.
Wei Gao, Weifan Wang
2021 J jnl
Tight bounds for the existence of path factors in network vulnerability parameter settings.
Int. J. Intell. Syst.
Wei Gao, Weifan Wang, Yaojun Chen
2020 J jnl
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles.
Discret. Math. Algorithms Appl.
Danjun Huang, Xiaoxiu Zhang, Weifan Wang, Stephen Finbow
2020 J jnl
An improved upper bound for the acyclic chromatic number of 1-planar graphs.
Discret. Appl. Math.
Wanshun Yang, Weifan Wang, Yiqiao Wang
2020 J jnl
Choosability with separation of planar graphs without prescribed cycles.
Appl. Math. Comput.
Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang
2020 J jnl
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve.
J. Comb. Optim.
Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia
2020 J jnl
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.
J. Graph Theory
Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih
2019 J jnl
Acyclic coloring of IC-planar graphs.
Discret. Math.
Wanshun Yang, Weifan Wang, Yiqiao Wang
2019 J jnl
Light structures in 1-planar graphs with an application to linear 2-arboricity.
Discret. Appl. Math.
Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang
2019 J jnl
List coloring and diagonal coloring for plane graphs of diameter two.
Appl. Math. Comput.
Danjun Huang, Yiqiao Wang, Jing Lv, Yanping Yang, Weifan Wang
2019 J jnl
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.
J. Comb. Optim.
Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang
2019 J jnl
Star edge-coloring of graphs with maximum degree four.
Appl. Math. Comput.
Ying Wang, Yiqiao Wang, Weifan Wang
2018 J jnl
2-Distance vertex-distinguishing index of subcubic graphs.
J. Comb. Optim.
Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen
2018 J jnl
2-distance vertex-distinguishing total coloring of graphs.
Discret. Math. Algorithms Appl.
Yafang Hu, Weifan Wang
2018 J jnl
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.
Discret. Math.
Jingjing Huo, Weifan Wang, Yiqiao Wang
2018 J jnl
A note on the list vertex arboricity of toroidal graphs.
Discret. Math.
Yiqiao Wang, Min Chen, Weifan Wang
2018 J jnl
Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion.
Int. J. Comput. Math.
Wei Gao, Weifan Wang
2018 J jnl
Edge-partition and star chromatic index.
Appl. Math. Comput.
Yiqiao Wang, Weifan Wang, Ying Wang
2018 J jnl
Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic.
Graphs Comb.
Xiaoxue Hu, Weifan Wang, Yiqiao Wang, Ping Wang
2018 J jnl
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.
Appl. Math. Comput.
Min Chen, Weiqiang Yu, Weifan Wang
2018 J jnl
Planar graphs with maximum degree 4 are strongly 19-edge-colorable.
Discret. Math.
Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen
2018 J jnl
Planar graphs without chordal 5-cycles are 2-good.
J. Comb. Optim.
Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang
2018 J jnl
Planar graphs without chordal 6-cycles are 4-choosable.
Discret. Appl. Math.
Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu
2018 J jnl
Strong chromatic index of
Inf. Process. Lett.
Yiqiao Wang, Ping Wang, Weifan Wang
2018 J jnl
The neighbor expanded sum distinguishing index of Halin graphs.
Ars Comb.
Jingjing Huo, Wai Chee Shiu, Weifan Wang
2017 J jnl
A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1.
J. Comb. Optim.
Qiaojun Shu, Weifan Wang, Yiqiao Wang
2017 J jnl
A sufficient condition for planar graphs to be (3, 1)-choosable.
J. Comb. Optim.
Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang
2017 J jnl
Neighbor Sum Distinguishing Index of Subcubic Graphs.
Graphs Comb.
Jingjing Huo, Weifan Wang, Chuandong Xu
2017 J jnl
Neighbor-sum-distinguishing edge choosability of subcubic graphs.
J. Comb. Optim.
Jingjing Huo, Yiqiao Wang, Weifan Wang
2017 J jnl
The chromatic number of the square of a Halin graph with maximum degree five is six.
Ars Comb.
Yiqiao Wang, Xiaoxue Hu, Weifan Wang
2017 J jnl
The entire chromatic number of graphs embedded on the torus with large maximum degree.
Theor. Comput. Sci.
Xiaoxue Hu, Ping Wang, Yiqiao Wang, Weifan Wang
2016 J jnl
A (3, 1) ∗-choosable theorem on planar graphs.
J. Comb. Optim.
Min Chen, André Raspaud, Weifan Wang
2016 J jnl
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Glob. Optim.
Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du
2016 J jnl
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable.
J. Comb. Optim.
Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen
2016 J jnl
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles.
Discret. Math.
Min Chen, Li Huang, Weifan Wang
2016 J jnl
Plane graphs with maximum degree 9 are entirely 11-choosable.
Discret. Math.
Xiaoxue Hu, Weifan Wang, Wai Chee Shiu, Yiqiao Wang
2016 J jnl
Rainbow cliques in edge-colored graphs.
Eur. J. Comb.
Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang
2015 J jnl
(2, 1)-total labeling of trees with large maximum degree.
Discret. Appl. Math.
Dong Chen, Wai Chee Shiu, Qiaojun Shu, Pak Kiu Sun, Weifan Wang
2015 J jnl
Adjacent vertex distinguishing indices of planar graphs without 3-cycles.
Discret. Math.
Danjun Huang, Zhengke Miao, Weifan Wang
2015 J jnl
Equitable total-coloring of subcubic graphs.
Discret. Appl. Math.
Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang
2015 J jnl
The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures.
Comput. Math. Methods Medicine
Wei Gao, Weifan Wang
2014 J jnl
A lower bound of the surviving rate of a planar graph with girth at least seven.
J. Comb. Optim.
Weifan Wang, Stephen Finbow, Ping Wang
2014 J jnl
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five.
J. Comb. Optim.
Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang
2014 J jnl
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.
Discret. Appl. Math.
Lianzhu Zhang, Weifan Wang, Ko-Wei Lih
2014 J jnl
On Neighbor-Distinguishing Index of Planar Graphs.
J. Graph Theory
Mirko Hornák, Danjun Huang, Weifan Wang
2014 J jnl
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.
Graphs Comb.
Min Chen, André Raspaud, Weifan Wang
2014 J jnl
Star list chromatic number of planar subcubic graphs.
J. Comb. Optim.
Min Chen, André Raspaud, Weifan Wang
2014 J jnl
The 2-surviving rate of planar graphs without 6-cycles.
Theor. Comput. Sci.
Weifan Wang, Stephen Finbow, Jiangxu Kong
2014 J jnl
The adjacent vertex distinguishing total coloring of planar graphs.
J. Comb. Optim.
Weifan Wang, Danjun Huang
2014 J jnl
The edge-face choosability of plane graphs with maximum degree at least 9.
Discret. Math.
Xiaoxue Hu, Weifan Wang, Yiqiao Wang
2013 J jnl
6-Star-Coloring of Subcubic Graphs.
J. Graph Theory
Min Chen, André Raspaud, Weifan Wang
2013 J jnl
A new upper bound on the acyclic chromatic indices of planar graphs.
Eur. J. Comb.
Weifan Wang, Qiaojun Shu, Yiqiao Wang
2013 J jnl
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4.
J. Graph Theory
Qiaojun Shu, Weifan Wang, Yiqiao Wang
2013 J jnl
Acyclic edge coloring of planar graphs without 4-cycles.
J. Comb. Optim.
Weifan Wang, Qiaojun Shu, Yiqiao Wang
2013 J jnl
Acyclic list edge coloring of outerplanar graphs.
Discret. Math.
Qiaojun Shu, Yiqiao Wang, Weifan Wang
2013 J jnl
Linear Coloring of Planar Graphs Without 4-Cycles.
Graphs Comb.
Weifan Wang, Yiqiao Wang
2013 J jnl
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle.
Discret. Appl. Math.
Yiqiao Wang, Qiaojun Shu, Weifan Wang
2013 J jnl
Vertex arboricity of planar graphs without chordal 6-cycles.
Int. J. Comput. Math.
Danjun Huang, Weifan Wang
2012 J jnl
A Note on General Neighbor-Distinguishing Total Coloring of Graphs.
Ars Comb.
Danjun Huang, Weifan Wang, Jianxing Yin
2012 J jnl
A note on the adjacent vertex distinguishing total chromatic number of graphs.
Discret. Math.
Danjun Huang, Weifan Wang, Chengchao Yan
2012 J jnl
Acyclic chromatic indices of planar graphs with girth at least five.
J. Comb. Optim.
Qiaojun Shu, Weifan Wang
2012 J jnl
Acyclic edge coloring of planar graphs without 5-cycles.
Discret. Appl. Math.
Qiaojun Shu, Weifan Wang, Yiqiao Wang
2012 J jnl
An improved bound on parity vertex colourings of outerplane graphs.
Discret. Math.
Weifan Wang, Stephen Finbow, Ping Wang
2012 J jnl
Every 4-regular graph is acyclically edge-6-colorable
CoRR
Weifan Wang, Qiaojun Shu, Yiqiao Wang
2012 J jnl
Fault tolerant path-embedding in locally twisted cubes.
Ars Comb.
Caiyue Ye, Meijie Ma, Weifan Wang
2012 J jnl
On backbone coloring of graphs.
J. Comb. Optim.
Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
2012 J jnl
On the vertex-arboricity of planar graphs without 7-cycles.
Discret. Math.
Danjun Huang, Wai Chee Shiu, Weifan Wang
2012 J jnl
Planar Graphs of Maximum Degree Six without 7-cycles are Class One.
Electron. J. Comb.
Danjun Huang, Weifan Wang
2012 J jnl
Some results on the injective chromatic number of graphs.
J. Comb. Optim.
Min Chen, Gena Hahn, André Raspaud, Weifan Wang
2012 J jnl
The 2-surviving rate of planar graphs without 4-cycles.
Theor. Comput. Sci.
Weifan Wang, Jiangxu Kong, Lianzhu Zhang
2012 J jnl
The surviving rate of planar graphs.
Theor. Comput. Sci.
Jiangxu Kong, Weifan Wang, Xuding Zhu
2012 J jnl
Vertex-arboricity of planar graphs without intersecting triangles.
Eur. J. Comb.
Min Chen, André Raspaud, Weifan Wang
2011 J jnl
8-star-choosability of a graph with maximum average degree less than 3.
Discret. Math. Theor. Comput. Sci.
Min Chen, André Raspaud, Weifan Wang
2011 J jnl
Acyclic chromatic indices of planar graphs with large girth.
Discret. Appl. Math.
Weifan Wang, Qiaojun Shu, Kan Wang, Ping Wang
2011 J jnl
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.
Discuss. Math. Graph Theory
Yuehua Bu, Ko-Wei Lih, Weifan Wang
2011 J jnl
Adjacent vertex-distinguishing edge colorings of K
Appl. Math. Lett.
Weifan Wang, Yiqiao Wang
2011 C ed.
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings
COCOA
Weifan Wang, Xuding Zhu, Ding-Zhu Du
2011 J jnl
Entire colouring of plane graphs.
J. Comb. Theory B
Weifan Wang, Xuding Zhu
2011 J jnl
The surviving rate of an outerplanar graph for the firefighter problem.
Theor. Comput. Sci.
Weifan Wang, Xubin Yue, Xuding Zhu
2011 J jnl
Upper bounds on the linear chromatic number of a graph.
Discret. Math.
Chao Li, Weifan Wang, André Raspaud
2010 J jnl
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.
J. Comb. Optim.
Weifan Wang, Yiqiao Wang
2010 J jnl
Adjacent vertex distinguishing total colorings of outerplanar graphs.
J. Comb. Optim.
Yiqiao Wang, Weifan Wang
2010 J jnl
Choosability of toroidal graphs without short cycles.
J. Graph Theory
Leizhen Cai, Weifan Wang, Xuding Zhu
2010 J jnl
The surviving rate of an infected network.
Theor. Comput. Sci.
Weifan Wang, Stephen Finbow, Ping Wang
2009 J jnl
(2, 1)-Total labelling of trees with sparse vertices of maximum degree.
Inf. Process. Lett.
Jing Huang, Haina Sun, Weifan Wang, Dong Chen
2009 J jnl
(2, 1)-Total number of trees with maximum degree three.
Inf. Process. Lett.
Weifan Wang, Dong Chen
2009 J jnl
Edge choosability of planar graphs without 5-cycles with a chord.
Discret. Math.
Yongzhu Chen, Weiyi Zhu, Weifan Wang
2009 J jnl
Injective coloring of planar graphs.
Discret. Appl. Math.
Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang
2009 J jnl
Linear coloring of planar graphs with large girth.
Discret. Math.
André Raspaud, Weifan Wang
2009 J jnl
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.
Discret. Math.
Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
2009 J jnl
Planar graphs without 4-cycles are acyclically 6-choosable.
J. Graph Theory
Weifan Wang, Min Chen
2009 J jnl
Star coloring of sparse graphs.
J. Graph Theory
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang
2009 J jnl
The Surviving Rate of a Graph for the Firefighter Problem.
SIAM J. Discret. Math.
Leizhen Cai, Weifan Wang
2009 J jnl
The edge-face coloring of graphs embedded in a surface of characteristic zero.
Discret. Math.
Weifan Wang
2008 J jnl
A relaxation of Havel's 3-color problem.
Inf. Process. Lett.
Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
2008 J jnl
Acyclic 5-choosability of planar graphs without 4-cycles.
Discret. Math.
Min Chen, Weifan Wang
2008 J jnl
Diameters of uniform subset graphs.
Discret. Math.
Yongzhu Chen, Weifan Wang
2008 J jnl
Improper choosability of graphs of nonnegative characteristic.
Comput. Math. Appl.
Yongzhu Chen, Weiyi Zhu, Weifan Wang
2008 J jnl
Labelling planar graphs without 4-cycles with a condition on distance two.
Discret. Appl. Math.
Weifan Wang, Leizhen Cai
2008 J jnl
On 3-colorable planar graphs without short cycles.
Appl. Math. Lett.
Min Chen, Weifan Wang
2008 J jnl
On the vertex-arboricity of planar graphs.
Eur. J. Comb.
André Raspaud, Weifan Wang
2007 J jnl
(2, 1)-Total labelling of outerplanar graphs.
Discret. Appl. Math.
Dong Chen, Weifan Wang
2007 J jnl
A sufficient condition for a planar graph to be class 1.
Theor. Comput. Sci.
Weifan Wang, Yongzhu Chen
2007 J jnl
Acyclic 5-choosability of planar graphs without small cycles.
J. Graph Theory
Mickaël Montassier, André Raspaud, Weifan Wang
2007 J jnl
On 3-colorable planar graphs without cycles of four lengths.
Inf. Process. Lett.
Xiaofang Luo, Min Chen, Weifan Wang
2007 J jnl
On 3-colorable planar graphs without prescribed cycles.
Discret. Math.
Weifan Wang, Min Chen
2007 J jnl
Three-coloring planar graphs without short cycles.
Inf. Process. Lett.
Min Chen, André Raspaud, Weifan Wang
2007 J jnl
Total chromatic number of planar graphs with maximum degree ten.
J. Graph Theory
Weifan Wang
2006 J jnl
Bordeaux 3-color conjecture and 3-choosability.
Discret. Math.
Mickaël Montassier, André Raspaud, Weifan Wang
2006 J jnl
L(p, q)-labelling of K
Inf. Process. Lett.
Weifan Wang, Yiqiao Wang
2006 J jnl
Some sufficient conditions for a planar graph of maximum degree six to be Class 1.
Discret. Math.
Yuehua Bu, Weifan Wang
2006 J jnl
The 2-dipath chromatic number of Halin graphs.
Inf. Process. Lett.
Min Chen, Weifan Wang
2002 J jnl
Edge-partitions of planar graphs and their game coloring numbers.
J. Graph Theory
Wenjie He, Xiaoling Hou, Ko-Wei Lih, Jiating Shao, Weifan Wang, Xuding Zhu
2001 J jnl
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles.
Comb. Probab. Comput.
Weifan Wang, Ko-Wei Lih
2001 J jnl
The 4-choosability of planar graphs without 6-cycles.
Australas. J Comb.
Weifan Wang, Ko-Wei Lih
1999 J jnl
Upper Bounds of Entire Chromatic Number of Plane Graphs.
Eur. J. Comb.
Weifan Wang
1998 J jnl
Edge-face chromatic number of plane graphs with high maximum degree.
Australas. J Comb.
Weifan Wang, Kemin Zhang
1996 J jnl
On the vertex face total chromatic number of planar graphs.
J. Graph Theory
Weifan Wang, Jiazhuang Liu
1995 J jnl
On the colorings of outerplanar graphs.
Discret. Math.
Weifan Wang