Weifan Wang

2.2k total citations
117 papers, 1.5k citations indexed

About

Weifan Wang is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Weifan Wang has authored 117 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 108 papers in Computational Theory and Mathematics, 41 papers in Discrete Mathematics and Combinatorics and 24 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Weifan Wang's work include Advanced Graph Theory Research (103 papers), Graph Labeling and Dimension Problems (53 papers) and Limits and Structures in Graph Theory (40 papers). Weifan Wang is often cited by papers focused on Advanced Graph Theory Research (103 papers), Graph Labeling and Dimension Problems (53 papers) and Limits and Structures in Graph Theory (40 papers). Weifan Wang collaborates with scholars based in China, France and Taiwan. Weifan Wang's co-authors include Ko‐Wei Lih, Wei Gao, André Raspaud, Mohammad Reza Farahani, Min Chen, Wei Gao, Xuding Zhu, Yuehua Bu, Yaojun Chen and Mickaël Montassier and has published in prestigious journals such as SHILAP Revista de lepidopterología, Scientific Reports and Chaos Solitons & Fractals.

In The Last Decade

Weifan Wang

107 papers receiving 1.4k 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	1.2k	347	327	262	210	117	1.5k
Hajo Broersma Netherlands	23	1.4k 1.1×	728 2.1×	555 1.7×	433 1.7×	77 0.4×	220	1.9k
Jing Huang Canada	19	957 0.8×	240 0.7×	412 1.3×	233 0.9×	34 0.2×	96	1.2k
Jack E. Graver United States	15	362 0.3×	256 0.7×	278 0.9×	175 0.7×	27 0.1×	48	789
Gerhard Ringel United States	18	1.0k 0.8×	427 1.2×	384 1.2×	390 1.5×	361 1.7×	48	1.5k
Seiya Negami Japan	15	480 0.4×	208 0.6×	235 0.7×	116 0.4×	234 1.1×	75	669
Hong‐Jian Lai United States	22	1.7k 1.3×	553 1.6×	690 2.1×	295 1.1×	81 0.4×	247	1.9k
Michael D. Plummer United States	20	1.3k 1.0×	520 1.5×	447 1.4×	229 0.9×	138 0.7×	92	1.5k
Jixiang Meng China	17	633 0.5×	151 0.4×	331 1.0×	400 1.5×	10 0.0×	189	1.3k
Jin Akiyama Japan	15	498 0.4×	156 0.4×	233 0.7×	162 0.6×	108 0.5×	77	702
Arthur T. White United States	16	624 0.5×	410 1.2×	335 1.0×	337 1.3×	128 0.6×	52	1.1k

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, Weifan, et al.. (2024). Acyclic Edge Coloring of 1-planar Graphs without 4-cycles. Acta Mathematicae Applicatae Sinica English Series. 40(1). 35–44.

Wang, Yan, et al.. (2024). A note on the list vertex-arboricity of IC-planar graphs. Discrete Mathematics. 347(7). 113998–113998. 1 indexed citations

Wang, Weifan, et al.. (2023). IC-planar graphs are odd-10-colorable. Applied Mathematics and Computation. 451. 128020–128020. 2 indexed citations

Gao, Wei & Weifan Wang. (2021). Overview on fuzzy fractional coloring. SHILAP Revista de lepidopterología. 2. 196–201. 5 indexed citations

Wang, Weifan, et al.. (2018). Planar graphs without chordal 6-cycles are 4-choosable. Discrete Applied Mathematics. 244. 116–123. 3 indexed citations

Chen, Min, et al.. (2015). Toroidal graphs without 3-cycles adjacent to 5-cycles have list vertex-arboricity at most 2. 16(1). 97–105. 4 indexed citations

Ma, Meijie, et al.. (2012). Fault tolerant path-embedding in locally twisted cubes.. Ars Combinatoria. 107. 51–63. 1 indexed citations

Li, Chao, Weifan Wang, & André Raspaud. (2010). Upper bounds on the linear chromatic number of a graph. Discrete Mathematics. 311(4). 232–238. 4 indexed citations

Chen, Min & Weifan Wang. (2008). Acyclic 5-choosability of planar graphs without 4-cycles. Discrete Mathematics. 308(24). 6216–6225. 19 indexed citations

10.

Raspaud, André & Weifan Wang. (2008). On the vertex-arboricity of planar graphs. European Journal of Combinatorics. 29(4). 1064–1075. 37 indexed citations

11.

Raspaud, André & Weifan Wang. (2008). Linear coloring of planar graphs with large girth. Discrete Mathematics. 309(18). 5678–5686. 13 indexed citations

12.

Chen, Yongzhu, et al.. (2008). Edge choosability of planar graphs without 5-cycles with a chord. Discrete Mathematics. 309(8). 2233–2238. 3 indexed citations

13.

Wang, Weifan & Min Chen. (2007). On 3-colorable planar graphs without prescribed cycles. Discrete Mathematics. 307(22). 2820–2825. 8 indexed citations

14.

Bu, Yuehua & Weifan Wang. (2006). Some sufficient conditions for a planar graph of maximum degree six to be Class 1. Discrete Mathematics. 306(13). 1440–1445. 17 indexed citations

15.

Wang, Weifan & Ko‐Wei Lih. (2005). List coloring Halin graphs. Ars Combinatoria. 77. 53–63. 5 indexed citations

16.

Wang, Weifan & Ko‐Wei Lih. (2004). EQUITABLE LIST COLORING OF GRAPHS. Taiwanese Journal of Mathematics. 8(4). 747–759. 8 indexed citations

17.

Lih, Ko‐Wei, et al.. (2004). The Linear 2-Arboricity of Outerplanar Graphs.. Ars Combinatoria. 73(8). 13–22. 6 indexed citations

18.

Lih, Ko‐Wei, Weifan Wang, & Xuding Zhu. (2003). Coloring the square of a K4-minor free graph. Discrete Mathematics. 269(1-3). 303–309. 50 indexed citations

19.

Wang, Weifan & Ko‐Wei Lih. (2001). The 4-choosability of planar graphs without 6-cycles.. Australas. J Comb.. 24. 157–164. 8 indexed citations

20.

Wang, Weifan. (1999). Upper Bounds of Entire Chromatic Number of Plane Graphs. European Journal of Combinatorics. 20(4). 313–315. 5 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