Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeifan Wang 0001
Wei-Fan Wang 0001
Person information
- affiliation: Zhejiang Normal University, Department of Mathematics, Jinhua, China
- affiliation (former): Liaoning University, Department of Mathematics, Shenyang, China
- affiliation (PhD 1998): Nanjing University, Department of Mathematics, China
Other persons with the same name
- Weifan Wang 0002 — Chinese Academy of Sciences, Institute of Electrical Engineering, Key Laboratory of Power Electronics and Electric Drive, Beijing, China
- Weifan Wang 0003 — Central University of Finance and Economics, School of Information, Beijing, China
- Weifan Wang 0004 — Xi'an Jiaotong University, College of Computer Science and Technology, MOEKLINNS Lab, China
- Weifan Wang 0005 — Ant Group, China
- Weifan Wang 0006 — Henan University, School of Artificial Intelligence, Zhengzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j174]Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang:
Plane graphs of diameter two are 2-optimal. Appl. Math. Comput. 441: 127717 (2023)- [j173]Jiahao Yu, Min Chen, Weifan Wang:
2-Distance choosability of planar graphs with a restriction for maximum degree. Appl. Math. Comput. 448: 127949 (2023) - [j172]Chenran Pan
, Weifan Wang, Runrun Liu:
IC-planar graphs are odd-10-colorable. Appl. Math. Comput. 451: 128020 (2023) - [j171]Lina Zheng, Yiqiao Wang, Weifan Wang:
The Difference of Zagreb Indices of Halin Graphs. Axioms 12(5): 450 (2023) - [j170]Wei Gao, Weifan Wang, Yaojun Chen:
Isolated toughness and fractional (a,b,n)-critical graphs. Connect. Sci. 35(1) (2023) - [j169]Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo:
Neighbor-distinguishing indices of planar graphs with maximum degree ten. Discret. Appl. Math. 329: 49-60 (2023) - [j168]Jing Gu, Yiqiao Wang, Weifan Wang, Lina Zheng:
Strict neighbor-distinguishing index of K4-minor-free graphs. Discret. Appl. Math. 329: 87-95 (2023) - [j167]Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu:
An (F3, F5)-partition of planar graphs with girth at least 5. Discret. Math. 346(2): 113216 (2023) - [j166]Runrun Liu, Weifan Wang, Gexin Yu:
1-planar graphs are odd 13-colorable. Discret. Math. 346(8): 113423 (2023) - 2022
- [j165]Ying Wang, Yiqiao Wang, Weifan Wang, Shuyu Cui:
Strong Chromatic Index of Outerplanar Graphs. Axioms 11(4): 168 (2022) - [j164]Wenqian Zhang, Jianfeng Wang, Weifan Wang, Shengjin Ji:
On the Zero Forcing Number and Spectral Radius of Graphs. Electron. J. Comb. 29(1) (2022) - [j163]Aina Zhu, Dong Chen, Min Chen, Weifan Wang:
Vertex-arboricity of toroidal graphs without K5- and 6-cycles. Discret. Appl. Math. 310: 97-108 (2022) - [j162]Runrun Liu, Weifan Wang:
A sufficient condition for a planar graph to be (F, F2)-partitionable. Discret. Appl. Math. 318: 61-68 (2022) - [j161]Wei Gao, Weifan Wang, Yaojun Chen:
Tight isolated toughness bound for fractional (k, n)-critical graphs. Discret. Appl. Math. 322: 194-202 (2022) - [j160]Yiqiao Wang, Yanping Yang, Danjun Huang, Weifan Wang:
Two sufficient conditions for a planar graph to be list vertex-2-arborable. Discret. Math. 345(6): 112865 (2022) - [j159]Jiaao Li, Yulai Ma, Yongtang Shi, Weifan Wang, Yezhou Wu:
On 3-flow-critical graphs. Eur. J. Comb. 100: 103451 (2022) - [j158]Wei Gao, Weifan Wang, Lina Zheng:
Fuzzy fractional factors in fuzzy graphs. Int. J. Intell. Syst. 37(11): 9886-9903 (2022) - [j157]Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du, Weifan Wang:
Structure and pancyclicity of maximal planar graphs with diameter two. J. Comb. Optim. 43(1): 1-27 (2022) - [j156]Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, Cun-Quan Zhang:
Nowhere-zero 3-flows in toroidal graphs. J. Comb. Theory, Ser. B 153: 61-80 (2022) - [j155]Juan Liu, Yiqiao Wang, Weifan Wang:
Light edges in 1-planar graphs. J. Graph Theory 101(4): 746-768 (2022) - [j154]Yiqiao Wang, Juan Liu, Yongtang Shi, Weifan Wang:
Star Chromatic Index of 1-Planar Graphs. Symmetry 14(6): 1177 (2022) - 2021
- [j153]Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang:
A note on strong edge choosability of toroidal subcubic graphs. Australas. J Comb. 79: 284-294 (2021) - [j152]Weifan Wang, Xiaoxue Hu, Yiqiao Wang:
Entire coloring of 2-connected plane graphs. Eur. J. Comb. 94: 103286 (2021) - [j151]Jing Gu, Weifan Wang, Yiqiao Wang, Ying Wang:
Strict Neighbor-Distinguishing Index of Subcubic Graphs. Graphs Comb. 37(1): 355-368 (2021) - [j150]Yulai Ma, Yongtang Shi, Weifan Wang:
Acyclic Edge Coloring of Chordal Graphs with Bounded Degree. Graphs Comb. 37(6): 2621-2636 (2021) - [j149]Wei Gao, Weifan Wang, Yaojun Chen:
Tight bounds for the existence of path factors in network vulnerability parameter settings. Int. J. Intell. Syst. 36(3): 1133-1158 (2021) - [j148]Wei Gao, Weifan Wang:
Tight binding number bound for P≥3-factor uniform graphs. Inf. Process. Lett. 172: 106162 (2021) - [j147]Wanshun Yang, Yiqiao Wang, Wei-Fan Wang, Ko-Wei Lih:
IC-Planar Graphs Are 6-Choosable. SIAM J. Discret. Math. 35(3): 1729-1745 (2021) - 2020
- [j146]Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang:
Choosability with separation of planar graphs without prescribed cycles. Appl. Math. Comput. 367 (2020) - [j145]Wanshun Yang, Weifan Wang, Yiqiao Wang:
An improved upper bound for the acyclic chromatic number of 1-planar graphs. Discret. Appl. Math. 283: 275-291 (2020) - [j144]Danjun Huang, Xiaoxiu Zhang, Weifan Wang, Stephen Finbow:
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles. Discret. Math. Algorithms Appl. 12(4): 2050035:1-2050035:16 (2020) - [j143]Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia:
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. J. Comb. Optim. 39(1): 246-272 (2020) - [j142]Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih:
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. J. Graph Theory 95(1): 99-124 (2020)
2010 – 2019
- 2019
- [j141]Ying Wang, Yiqiao Wang, Weifan Wang:
Star edge-coloring of graphs with maximum degree four. Appl. Math. Comput. 340: 268-275 (2019) - [j140]Danjun Huang, Yiqiao Wang, Jing Lv, Yanping Yang, Weifan Wang:
List coloring and diagonal coloring for plane graphs of diameter two. Appl. Math. Comput. 363 (2019) - [j139]Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang:
Light structures in 1-planar graphs with an application to linear 2-arboricity. Discret. Appl. Math. 267: 120-130 (2019) - [j138]Wanshun Yang, Weifan Wang, Yiqiao Wang:
Acyclic coloring of IC-planar graphs. Discret. Math. 342(12) (2019) - [j137]Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang:
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. J. Comb. Optim. 37(3): 1071-1089 (2019) - 2018
- [j136]Min Chen, Weiqiang Yu, Weifan Wang:
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. Appl. Math. Comput. 326: 117-123 (2018) - [j135]Yiqiao Wang, Weifan Wang, Ying Wang:
Edge-partition and star chromatic index. Appl. Math. Comput. 333: 480-489 (2018) - [j134]Jingjing Huo, Wai Chee Shiu, Weifan Wang:
The neighbor expanded sum distinguishing index of Halin graphs. Ars Comb. 141: 63-73 (2018) - [j133]Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu:
Planar graphs without chordal 6-cycles are 4-choosable. Discret. Appl. Math. 244: 116-123 (2018) - [j132]Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen:
Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discret. Math. 341(6): 1629-1635 (2018) - [j131]Jingjing Huo, Weifan Wang, Yiqiao Wang:
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. Discret. Math. 341(11): 3044-3056 (2018) - [j130]Yiqiao Wang, Min Chen, Weifan Wang:
A note on the list vertex arboricity of toroidal graphs. Discret. Math. 341(12): 3344-3347 (2018) - [j129]Yafang Hu, Weifan Wang:
2-distance vertex-distinguishing total coloring of graphs. Discret. Math. Algorithms Appl. 10(2): 1850018:1-1850018:26 (2018) - [j128]Xiaoxue Hu, Weifan Wang, Yiqiao Wang, Ping Wang:
Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. Graphs Comb. 34(6): 1489-1506 (2018) - [j127]Wei Gao, Weifan Wang:
Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion. Int. J. Comput. Math. 95(8): 1527-1547 (2018) - [j126]Yiqiao Wang, Ping Wang, Weifan Wang:
Strong chromatic index of K4-minor free graphs. Inf. Process. Lett. 129: 53-56 (2018) - [j125]Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
Planar graphs without chordal 5-cycles are 2-good. J. Comb. Optim. 35(3): 980-996 (2018) - [j124]Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen:
2-Distance vertex-distinguishing index of subcubic graphs. J. Comb. Optim. 36(1): 108-120 (2018) - 2017
- [j123]Yiqiao Wang, Xiaoxue Hu, Weifan Wang:
The chromatic number of the square of a Halin graph with maximum degree five is six. Ars Comb. 133: 217-231 (2017) - [j122]Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
A note on the linear 2-arboricity of planar graphs. Discret. Math. 340(7): 1449-1455 (2017) - [j121]Jingjing Huo, Weifan Wang, Chuandong Xu:
Neighbor Sum Distinguishing Index of Subcubic Graphs. Graphs Comb. 33(2): 419-431 (2017) - [j120]Qiaojun Shu, Weifan Wang, Yiqiao Wang:
A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. J. Comb. Optim. 33(3): 1011-1020 (2017) - [j119]Jingjing Huo, Yiqiao Wang, Weifan Wang:
Neighbor-sum-distinguishing edge choosability of subcubic graphs. J. Comb. Optim. 34(3): 742-759 (2017) - [j118]Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang:
A sufficient condition for planar graphs to be (3, 1)-choosable. J. Comb. Optim. 34(4): 987-1011 (2017) - [j117]Xiaoxue Hu, Ping Wang, Yiqiao Wang, Weifan Wang:
The entire chromatic number of graphs embedded on the torus with large maximum degree. Theor. Comput. Sci. 689: 108-116 (2017) - 2016
- [j116]Min Chen, Li Huang, Weifan Wang:
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. Discret. Math. 339(10): 2526-2535 (2016) - [j115]Xiaoxue Hu, Weifan Wang, Wai Chee Shiu, Yiqiao Wang:
Plane graphs with maximum degree 9 are entirely 11-choosable. Discret. Math. 339(11): 2742-2753 (2016) - [j114]Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang:
Rainbow cliques in edge-colored graphs. Eur. J. Comb. 54: 193-200 (2016) - [j113]Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen:
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. J. Comb. Optim. 31(2): 893-901 (2016) - [j112]Wei-Fan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
The entire choosability of plane graphs. J. Comb. Optim. 31(3): 1221-1240 (2016) - [j111]Tingting Wu, Jiangxu Kong, Wei-Fan Wang:
The 2-surviving rate of planar graphs without 5-cycles. J. Comb. Optim. 31(4): 1479-1492 (2016) - [j110]Min Chen, André Raspaud, Weifan Wang:
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32(3): 927-940 (2016) - [j109]Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang, Ding-Zhu Du:
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. J. Glob. Optim. 65(2): 351-367 (2016) - 2015
- [j108]Fengwei Xu, Wei-Fan Wang, Ko-Wei Lih:
Full Orientability of the Square of a Cycle. Ars Comb. 122: 227-233 (2015) - [j107]Wei Gao, Weifan Wang:
The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures. Comput. Math. Methods Medicine 2015: 418106:1-418106:10 (2015) - [j106]Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang:
Equitable total-coloring of subcubic graphs. Discret. Appl. Math. 184: 167-170 (2015) - [j105]Dong Chen, Wai Chee Shiu, Qiaojun Shu, Pak Kiu Sun, Weifan Wang:
(2, 1)-total labeling of trees with large maximum degree. Discret. Appl. Math. 187: 61-69 (2015) - [j104]Danjun Huang, Zhengke Miao, Weifan Wang:
Adjacent vertex distinguishing indices of planar graphs without 3-cycles. Discret. Math. 338(3): 139-148 (2015) - [j103]Yiqiao Wang, Wei-Fan Wang, Jingjing Huo:
Some bounds on the neighbor-distinguishing index of graphs. Discret. Math. 338(11): 2006-2013 (2015) - [j102]Wei-Fan Wang, Danjun Huang:
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. SIAM J. Discret. Math. 29(4): 2412-2431 (2015) - [c1]Danjun Huang, Ko-Wei Lih, Wei-Fan Wang:
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. COCOA 2015: 617-632 - 2014
- [j101]Lianzhu Zhang, Weifan Wang, Ko-Wei Lih:
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Discret. Appl. Math. 162: 348-354 (2014) - [j100]Xiaoxue Hu, Weifan Wang, Yiqiao Wang:
The edge-face choosability of plane graphs with maximum degree at least 9. Discret. Math. 327: 1-8 (2014) - [j99]Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
The surviving rate of digraphs. Discret. Math. 334: 13-19 (2014) - [j98]Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
Structural properties and surviving rate of planar graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - [j97]Min Chen, André Raspaud, Weifan Wang:
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30(4): 861-874 (2014) - [j96]Weifan Wang, Danjun Huang:
The adjacent vertex distinguishing total coloring of planar graphs. J. Comb. Optim. 27(2): 379-396 (2014) - [j95]Min Chen, André Raspaud, Weifan Wang:
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27(3): 440-450 (2014) - [j94]Weifan Wang, Stephen Finbow, Ping Wang:
A lower bound of the surviving rate of a planar graph with girth at least seven. J. Comb. Optim. 27(4): 621-642 (2014) - [j93]Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang:
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. J. Comb. Optim. 28(4): 893-909 (2014) - [j92]Mirko Hornák, Danjun Huang, Weifan Wang:
On Neighbor-Distinguishing Index of Planar Graphs. J. Graph Theory 76(4): 262-278 (2014) - [j91]Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable. SIAM J. Discret. Math. 28(4): 1892-1905 (2014) - [j90]Weifan Wang, Stephen Finbow, Jiangxu Kong:
The 2-surviving rate of planar graphs without 6-cycles. Theor. Comput. Sci. 518: 22-31 (2014) - 2013
- [j89]Yiqiao Wang, Qiaojun Shu, Weifan Wang:
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Discret. Appl. Math. 161(16-17): 2687-2694 (2013) - [j88]Qiaojun Shu, Yiqiao Wang, Weifan Wang:
Acyclic list edge coloring of outerplanar graphs. Discret. Math. 313(3): 301-311 (2013) - [j87]Weifan Wang, Qiaojun Shu, Yiqiao Wang:
A new upper bound on the acyclic chromatic indices of planar graphs. Eur. J. Comb. 34(2): 338-354 (2013) - [j86]Weifan Wang, Yiqiao Wang:
Linear Coloring of Planar Graphs Without 4-Cycles. Graphs Comb. 29(4): 1113-1124 (2013) - [j85]Danjun Huang, Weifan Wang:
Vertex arboricity of planar graphs without chordal 6-cycles. Int. J. Comput. Math. 90(2): 258-272 (2013) - [j84]Weifan Wang, Qiaojun Shu, Yiqiao Wang:
Acyclic edge coloring of planar graphs without 4-cycles. J. Comb. Optim. 25(4): 562-586 (2013) - [j83]Min Chen, André Raspaud, Weifan Wang:
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72(2): 128-145 (2013) - [j82]Qiaojun Shu, Weifan Wang, Yiqiao Wang:
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. J. Graph Theory 73(4): 386-399 (2013) - 2012
- [j81]Caiyue Ye, Meijie Ma, Weifan Wang:
Fault tolerant path-embedding in locally twisted cubes. Ars Comb. 107: 51-63 (2012) - [j80]Danjun Huang, Weifan Wang, Jianxing Yin:
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107: 379-384 (2012) - [j79]Danjun Huang, Weifan Wang:
Planar Graphs of Maximum Degree Six without 7-cycles are Class One. Electron. J. Comb. 19(3): 17 (2012) - [j78]Qiaojun Shu, Weifan Wang, Yiqiao Wang:
Acyclic edge coloring of planar graphs without 5-cycles. Discret. Appl. Math. 160(7-8): 1211-1223 (2012) - [j77]Danjun Huang, Wai Chee Shiu, Weifan Wang:
On the vertex-arboricity of planar graphs without 7-cycles. Discret. Math. 312(15): 2304-2315 (2012) - [j76]Weifan Wang, Stephen Finbow, Ping Wang:
An improved bound on parity vertex colourings of outerplane graphs. Discret. Math. 312(18): 2782-2787 (2012) - [j75]Danjun Huang, Weifan Wang, Chengchao Yan:
A note on the adjacent vertex distinguishing total chromatic number of graphs. Discret. Math. 312(24): 3544-3546 (2012) - [j74]Min Chen, André Raspaud, Weifan Wang:
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33(5): 905-923 (2012) - [j73]Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On backbone coloring of graphs. J. Comb. Optim. 23(1): 79-93 (2012) - [j72]Qiaojun Shu, Weifan Wang:
Acyclic chromatic indices of planar graphs with girth at least five. J. Comb. Optim. 23(1): 140-157 (2012) - [j71]Min Chen, Gena Hahn, André Raspaud, Weifan Wang:
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24(3): 299-318 (2012) - [j70]Jiangxu Kong, Weifan Wang, Xuding Zhu:
The surviving rate of planar graphs. Theor. Comput. Sci. 416: 65-70 (2012) - [j69]Weifan Wang, Jiangxu Kong, Lianzhu Zhang:
The 2-surviving rate of planar graphs without 4-cycles. Theor. Comput. Sci. 457: 158-165 (2012) - [i1]Weifan Wang, Qiaojun Shu, Yiqiao Wang:
Every 4-regular graph is acyclically edge-6-colorable. CoRR abs/1209.2471 (2012) - 2011
- [j68]Weifan Wang, Yiqiao Wang:
Adjacent vertex-distinguishing edge colorings of K4-minor free graphs. Appl. Math. Lett. 24(12): 2034-2037 (2011) - [j67]Weifan Wang, Qiaojun Shu, Kan Wang, Ping Wang:
Acyclic chromatic indices of planar graphs with large girth. Discret. Appl. Math. 159(12): 1239-1253 (2011) - [j66]Chao Li, Weifan Wang, André Raspaud:
Upper bounds on the linear chromatic number of a graph. Discret. Math. 311(4): 232-238 (2011) - [j65]Yuehua Bu, Ko-Wei Lih, Weifan Wang:
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discuss. Math. Graph Theory 31(3): 429-439 (2011) - [j64]Min Chen, André Raspaud, Weifan Wang:
8-star-choosability of a graph with maximum average degree less than 3. Discret. Math. Theor. Comput. Sci. 13(3): 97-110 (2011) - [j63]Weifan Wang, Xuding Zhu:
Entire colouring of plane graphs. J. Comb. Theory, Ser. B 101(6): 490-501 (2011) - [j62]Weifan Wang, Xubin Yue, Xuding Zhu:
The surviving rate of an outerplanar graph for the firefighter problem. Theor. Comput. Sci. 412(8-10): 913-921 (2011) - [e1]Weifan Wang, Xuding Zhu, Ding-Zhu Du:
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings. Lecture Notes in Computer Science 6831, Springer 2011, ISBN 978-3-642-22615-1 [contents] - 2010
- [j61]Yiqiao Wang, Weifan Wang:
Adjacent vertex distinguishing total colorings of outerplanar graphs. J. Comb. Optim. 19(2): 123-133 (2010) - [j60]Weifan Wang, Yiqiao Wang:
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19(4): 471-485 (2010) - [j59]Leizhen Cai, Weifan Wang, Xuding Zhu:
Choosability of toroidal graphs without short cycles. J. Graph Theory 65(1): 1-15 (2010) - [j58]Weifan Wang, Stephen Finbow, Ping Wang:
The surviving rate of an infected network. Theor. Comput. Sci. 411(40-42): 3651-3660 (2010)
2000 – 2009
- 2009
- [j57]Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih:
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. Appl. Math. Lett. 22(9): 1369-1373 (2009) - [j56]Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang:
Injective coloring of planar graphs. Discret. Appl. Math. 157(4): 663-672 (2009) - [j55]Yongzhu Chen, Weiyi Zhu, Weifan Wang:
Edge choosability of planar graphs without 5-cycles with a chord. Discret. Math. 309(8): 2233-2238 (2009) - [j54]Weifan Wang:
The edge-face coloring of graphs embedded in a surface of characteristic zero. Discret. Math. 309(11): 3523-3533 (2009) - [j53]Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang:
On (d, 1)-total numbers of graphs. Discret. Math. 309(12): 3767-3773 (2009) - [j52]Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discret. Math. 309(13): 4596-4607 (2009) - [j51]André Raspaud, Weifan Wang:
Linear coloring of planar graphs with large girth. Discret. Math. 309(18): 5678-5686 (2009) - [j50]Jing Huang, Haina Sun, Weifan Wang, Dong Chen:
(2, 1)-Total labelling of trees with sparse vertices of maximum degree. Inf. Process. Lett. 109(3): 199-203 (2009) - [j49]Weifan Wang, Dong Chen:
(2, 1)-Total number of trees with maximum degree three. Inf. Process. Lett. 109(14): 805-810 (2009) - [j48]Weifan Wang, Min Chen:
Planar graphs without 4-cycles are acyclically 6-choosable. J. Graph Theory 61(4): 307-323 (2009) - [j47]Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang:
Star coloring of sparse graphs. J. Graph Theory 62(3): 201-219 (2009) - [j46]Leizhen Cai, Weifan Wang:
The Surviving Rate of a Graph for the Firefighter Problem. SIAM J. Discret. Math. 23(4): 1814-1826 (2009) - 2008
- [j45]Min Chen, Weifan Wang:
On 3-colorable planar graphs without short cycles. Appl. Math. Lett. 21(9): 961-965 (2008) - [j44]Wei-Fan Wang, Ko-Wei Lih:
Note on Coloring the Square of an Outerplanar Graph. Ars Comb. 86 (2008) - [j43]Yongzhu Chen, Weiyi Zhu, Weifan Wang:
Improper choosability of graphs of nonnegative characteristic. Comput. Math. Appl. 56(8): 2073-2078 (2008) - [j42]Weifan Wang, Leizhen Cai:
Labelling planar graphs without 4-cycles with a condition on distance two. Discret. Appl. Math. 156(12): 2241-2249 (2008) - [j41]Min Chen, Weifan Wang:
Acyclic 5-choosability of planar graphs without 4-cycles. Discret. Math. 308(24): 6216-6225 (2008) - [j40]Yongzhu Chen, Weifan Wang:
Diameters of uniform subset graphs. Discret. Math. 308(24): 6645-6649 (2008) - [j39]André Raspaud, Weifan Wang:
On the vertex-arboricity of planar graphs. Eur. J. Comb. 29(4): 1064-1075 (2008) - [j38]Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang:
A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107(3-4): 107-109 (2008) - [j37]Wei-Fan Wang, Ko-Wei Lih:
Coupled choosability of plane graphs. J. Graph Theory 58(1): 27-44 (2008) - 2007
- [j36]Dong Chen, Weifan Wang:
(2, 1)-Total labelling of outerplanar graphs. Discret. Appl. Math. 155(18): 2585-2593 (2007) - [j35]Weifan Wang, Min Chen:
On 3-colorable planar graphs without prescribed cycles. Discret. Math. 307(22): 2820-2825 (2007) - [j34]Wei-Fan Wang, Ko-Wei Lih:
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. Eur. J. Comb. 28(1): 111-120 (2007) - [j33]Min Chen, André Raspaud, Weifan Wang:
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007) - [j32]Xiaofang Luo, Min Chen, Weifan Wang:
On 3-colorable planar graphs without cycles of four lengths. Inf. Process. Lett. 103(4): 150-156 (2007) - [j31]Weifan Wang:
Total chromatic number of planar graphs with maximum degree ten. J. Graph Theory 54(2): 91-102 (2007) - [j30]Mickaël Montassier, André Raspaud, Weifan Wang:
Acyclic 5-choosability of planar graphs without small cycles. J. Graph Theory 54(3): 245-260 (2007) - [j29]Weifan Wang, Yongzhu Chen:
A sufficient condition for a planar graph to be class 1. Theor. Comput. Sci. 385(1-3): 71-77 (2007) - 2006
- [j28]Wei-Fan Wang:
The L(2, 1)-labelling of trees. Discret. Appl. Math. 154(3): 598-603 (2006) - [j27]Wei-Fan Wang:
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers. Discret. Math. 306(2): 262-270 (2006) - [j26]Mickaël Montassier, André Raspaud, Weifan Wang:
Bordeaux 3-color conjecture and 3-choosability. Discret. Math. 306(6): 573-579 (2006) - [j25]Yuehua Bu, Weifan Wang:
Some sufficient conditions for a planar graph of maximum degree six to be Class 1. Discret. Math. 306(13): 1440-1445 (2006) - [j24]Weifan Wang, Yiqiao Wang:
L(p, q)-labelling of K4-minor free graphs. Inf. Process. Lett. 98(5): 169-173 (2006) - [j23]Min Chen, Weifan Wang:
The 2-dipath chromatic number of Halin graphs. Inf. Process. Lett. 99(2): 47-53 (2006) - 2005
- [j22]Wei-Fan Wang, Ko-Wei Lih:
List Coloring Halin Graphs. Ars Comb. 77 (2005) - 2004
- [j21]Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Outerplanar Graphs. Ars Comb. 73 (2004) - [j20]Wei-Fan Wang:
Vertex-pancyclicity of edge-face-total graphs. Discret. Appl. Math. 143(1-3): 364-367 (2004) - [j19]Wei-Fan Wang, Ko-Wei Lih:
The edge-face choosability of plane graphs. Eur. J. Comb. 25(7): 935-948 (2004) - 2003
- [j18]Chun-Yen Chou, Wei-Fan Wang, Xuding Zhu:
Relaxed game chromatic number of graphs. Discret. Math. 262(1-3): 89-98 (2003) - [j17]Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu:
Coloring the square of a K4-minor free graph. Discret. Math. 269(1-3): 303-309 (2003) - [j16]Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Planar Graphs. Graphs Comb. 19(2): 241-248 (2003) - [j15]Wei-Fan Wang, Ko-Wei Lih:
Labeling Planar Graphs with Conditions on Girth and Distance Two. SIAM J. Discret. Math. 17(2): 264-275 (2003) - 2002
- [j14]Wei-Fan Wang, Ko-Wei Lih:
Choosability and edge choosability of planar graphs without five cycles. Appl. Math. Lett. 15(5): 561-565 (2002) - [j13]Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang:
Edge-pancyclicity of coupled graphs. Discret. Appl. Math. 119(3): 259-264 (2002) - [j12]Wei-Fan Wang, Ko-Wei Lih:
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. Discret. Math. 253(1-3): 87-95 (2002) - [j11]Wei-Fan Wang:
Equitable Total Coloring of Graphs with Maximum Degree 3. Graphs Comb. 18(3): 677-685 (2002) - [j10]Wenjie He, Xiaoling Hou, Ko-Wei Lih, Jiating Shao, Weifan Wang, Xuding Zhu:
Edge-partitions of planar graphs and their game coloring numbers. J. Graph Theory 41(4): 307-317 (2002) - [j9]Wei-Fan Wang, Ko-Wei Lih:
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. SIAM J. Discret. Math. 15(4): 538-545 (2002) - 2001
- [j8]Weifan Wang, Ko-Wei Lih:
The 4-choosability of planar graphs without 6-cycles. Australas. J Comb. 24: 157-164 (2001) - [j7]Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang:
A note on list improper coloring planar graphs. Appl. Math. Lett. 14(3): 269-273 (2001) - [j6]Weifan Wang, Ko-Wei Lih:
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles. Comb. Probab. Comput. 10(3): 267-276 (2001) - [j5]Wei-Fan Wang, Ko-Wei Lih:
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. Eur. J. Comb. 22(1): 71-78 (2001)
1990 – 1999
- 1999
- [j4]Weifan Wang:
Upper Bounds of Entire Chromatic Number of Plane Graphs. Eur. J. Comb. 20(4): 313-315 (1999) - 1998
- [j3]Weifan Wang, Kemin Zhang:
Edge-face chromatic number of plane graphs with high maximum degree. Australas. J Comb. 18: 235-244 (1998) - 1996
- [j2]Weifan Wang, Jiazhuang Liu:
On the vertex face total chromatic number of planar graphs. J. Graph Theory 22(1): 29-37 (1996) - 1995
- [j1]Weifan Wang:
On the colorings of outerplanar graphs. Discret. Math. 147(1-3): 257-269 (1995)
Coauthor Index
[j174] [j171] [j168] [j165] [j160] [j157] [j155] [j154] [j152] [j151] [j147] [j145] [j143] [j142] [j141] [j140] [j139] [j138] [j137] [j135] [j131] [j130] [j128] [j126] [j125] [j123] [j122] [j120] [j119] [j118] [j117] [j115] [j112] [j109] [j106] [j103] [j100] [j91] [j89] [j88] [j87] [j86] [j84] [j82] [j78] [i1] [j68] [j61] [j60] [j24]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-25 20:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
