Weifan Wang

1.9k total citations
112 papers, 1.3k citations indexed

About

Weifan Wang is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Weifan Wang has authored 112 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 102 papers in Computational Theory and Mathematics, 20 papers in Geometry and Topology and 18 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Weifan Wang's work include Graph Labeling and Dimension Problems (72 papers), Advanced Graph Theory Research (63 papers) and Graph theory and applications (19 papers). Weifan Wang is often cited by papers focused on Graph Labeling and Dimension Problems (72 papers), Advanced Graph Theory Research (63 papers) and Graph theory and applications (19 papers). Weifan Wang collaborates with scholars based in China, Canada and Taiwan. Weifan Wang's co-authors include Yiqiao Wang, Wei Gao, Wei Gao, Darko Dimitrov, Ko‐Wei Lih, Ko‐Wei Lih, Min Chen, Xuding Zhu, Ping Wang and Mirko Horňák and has published in prestigious journals such as Applied Mathematics and Computation, Arabian Journal of Chemistry and Theoretical Computer Science.

In The Last Decade

Weifan Wang

102 papers receiving 1.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Weifan Wang China	20	918	208	188	175	131	112	1.3k
Yiqiao Wang China	19	539 0.6×	156 0.8×	122 0.6×	77 0.4×	164 1.3×	95	1.4k
Darko Dimitrov Germany	19	706 0.8×	727 3.5×	45 0.2×	45 0.3×	104 0.8×	58	1.1k
Abdul Qudair Baig Pakistan	18	796 0.9×	710 3.4×	95 0.5×	17 0.1×	104 0.8×	80	1.2k
Eun Jung Kim United States	21	235 0.3×	16 0.1×	485 2.6×	34 0.2×	67 0.5×	118	1.5k
Md. Saidur Rahman Bangladesh	13	244 0.3×	14 0.1×	76 0.4×	43 0.2×	22 0.2×	102	609
Jason I. Brown Canada	15	545 0.6×	408 2.0×	62 0.3×	371 2.1×	6 0.0×	105	892
Xiaoxiao Zhang China	10	146 0.2×	38 0.2×	56 0.3×	6 0.0×	18 0.1×	21	544
Wenyan Wang China	17	68 0.1×	6 0.0×	58 0.3×	4 0.0×	76 0.6×	61	964
Jingling Zhang China	19	68 0.1×	100 0.5×	87 0.5×	1 0.0×	79 0.6×	90	927

Countries citing papers authored by Weifan Wang

Since Specialization

Citations

This map shows the geographic impact of Weifan Wang's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Weifan Wang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Weifan Wang more than expected).

Fields of papers citing papers by Weifan Wang

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Weifan Wang. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Weifan Wang. The network helps show where Weifan Wang may publish in the future.

Co-authorship network of co-authors of Weifan Wang

This figure shows the co-authorship network connecting the top 25 collaborators of Weifan Wang. A scholar is included among the top collaborators of Weifan Wang based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Weifan Wang. Weifan Wang is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Wang, Jianfeng, et al.. (2023). The matchings and spectral radius of graphs involving minimum degree. Linear Algebra and its Applications. 668. 149–160.

Chen, Min, et al.. (2021). A note on strong edge choosability of toroidal subcubic graphs.. Australas. J Comb.. 79. 284–294.

Lih, Ko‐Wei, et al.. (2019). Light structures in 1-planar graphs with an application to linear 2-arboricity. Discrete Applied Mathematics. 267. 120–130. 10 indexed citations

Wang, Weifan, et al.. (2018). A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. Discrete Mathematics. 341(11). 3044–3056. 3 indexed citations

Wang, Ping, et al.. (2017). The entire chromatic number of graphs embedded on the torus with large maximum degree. Theoretical Computer Science. 689. 108–116. 1 indexed citations

Shiu, Wai Chee, et al.. (2015). (2,1)-total labeling of trees with large maximum degree. Discrete Applied Mathematics. 187. 61–69.

Wang, Yiqiao, et al.. (2015). Some bounds on the neighbor-distinguishing index of graphs. Discrete Mathematics. 338(11). 2006–2013. 16 indexed citations

Wang, Weifan, et al.. (2014). The edge-face choosability of plane graphs with maximum degree at least 9. Discrete Mathematics. 327. 1–8. 1 indexed citations

Wang, Yiqiao, et al.. (2013). The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Discrete Applied Mathematics. 161(16-17). 2687–2694. 2 indexed citations

10.

Wang, Weifan, et al.. (2012). (2,1)-TOTAL NUMBER OF JOINS OF PATHS AND CYCLES. Taiwanese Journal of Mathematics. 16(2). 605–619. 1 indexed citations

11.

Wang, Weifan, et al.. (2012). A Note on General Neighbor-Distinguishing Total Coloring of Graphs.. Ars Combinatoria. 107. 379–384. 1 indexed citations

12.

Wang, Weifan, et al.. (2012). A note on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Mathematics. 312(24). 3544–3546. 16 indexed citations

13.

Wang, Yiqiao, et al.. (2012). Acyclic list edge coloring of outerplanar graphs. Discrete Mathematics. 313(3). 301–311.

14.

Wang, Weifan, Xuding Zhu, & Ding‐Zhu Du. (2011). Combinatorial optimization and applications : 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1 indexed citations

15.

Wang, Weifan, et al.. (2011). The surviving rate of planar graphs. Theoretical Computer Science. 416. 65–70. 19 indexed citations

16.

Wang, Weifan & Yiqiao Wang. (2011). Adjacent vertex-distinguishing edge colorings of K4-minor free graphs. Applied Mathematics Letters. 24(12). 2034–2037. 25 indexed citations

17.

Wang, Weifan & Ko‐Wei Lih. (2008). Note on Coloring the Square of an Outerplanar Graph.. Ars Combinatoria. 86. 2 indexed citations

18.

Wang, Weifan. (2005). The L(2,1)-labelling of trees. Discrete Applied Mathematics. 154(3). 598–603. 32 indexed citations

19.

Wang, Weifan & Ko‐Wei Lih. (2001). Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. European Journal of Combinatorics. 22(1). 71–78. 28 indexed citations

20.

Wang, Weifan. (1999). Upper Bounds of Entire Chromatic Number of Plane Graphs.. European Journal of Combinatorics. 20. 313–315. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact