Genghua Fan

1.4k total citations
63 papers, 781 citations indexed

About

Genghua Fan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Genghua Fan has authored 63 papers receiving a total of 781 indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 35 papers in Discrete Mathematics and Combinatorics and 23 papers in Geometry and Topology. Recurrent topics in Genghua Fan's work include Advanced Graph Theory Research (56 papers), Limits and Structures in Graph Theory (34 papers) and Graph theory and applications (23 papers). Genghua Fan is often cited by papers focused on Advanced Graph Theory Research (56 papers), Limits and Structures in Graph Theory (34 papers) and Graph theory and applications (23 papers). Genghua Fan collaborates with scholars based in China, United States and Canada. Genghua Fan's co-authors include H. A. Kierstead, André Raspaud, Jianfeng Hou, J. A. Bondy, Qinghai Liu, Xingxing Yu, Roland Häggkvist, Jianli Chen, Wenxing Zhu and Cun‐Quan Zhang and has published in prestigious journals such as IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Genghua Fan

57 papers receiving 727 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Genghua Fan China 17 667 450 273 193 159 63 781
Frédéric Havet France 16 675 1.0× 282 0.6× 67 0.2× 209 1.1× 98 0.6× 96 746
Chı́nh T. Hoàng Canada 18 895 1.3× 389 0.9× 150 0.5× 144 0.7× 148 0.9× 78 957
H.J. Veldman Netherlands 17 632 0.9× 348 0.8× 289 1.1× 121 0.6× 185 1.2× 58 686
Éric Sopena France 15 823 1.2× 467 1.0× 88 0.3× 165 0.9× 62 0.4× 58 882
Ingo Schiermeyer Germany 19 1.3k 1.9× 826 1.8× 408 1.5× 194 1.0× 162 1.0× 149 1.3k
Dominique Sotteau France 13 344 0.5× 177 0.4× 116 0.4× 363 1.9× 280 1.8× 34 611
Geoffrey Exoo United States 12 424 0.6× 267 0.6× 238 0.9× 191 1.0× 171 1.1× 61 609
Zdeněk Ryjáček Czechia 15 934 1.4× 500 1.1× 328 1.2× 165 0.9× 285 1.8× 86 970
Kristina Vušković United Kingdom 15 577 0.9× 246 0.5× 91 0.3× 98 0.5× 96 0.6× 48 632
Yannis Manoussakis France 14 402 0.6× 171 0.4× 99 0.4× 154 0.8× 108 0.7× 60 475

Countries citing papers authored by Genghua Fan

Since Specialization
Citations

This map shows the geographic impact of Genghua Fan'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 Genghua Fan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Genghua Fan more than expected).

Fields of papers citing papers by Genghua Fan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Genghua Fan. 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 Genghua Fan. The network helps show where Genghua Fan may publish in the future.

Co-authorship network of co-authors of Genghua Fan

This figure shows the co-authorship network connecting the top 25 collaborators of Genghua Fan. A scholar is included among the top collaborators of Genghua Fan 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 Genghua Fan. Genghua Fan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Fan, Genghua, et al.. (2025). Hoffmann-Ostenhof's 3-Decomposition Conjecture. Discrete Mathematics. 348(7). 114454–114454.
2.
Fan, Genghua, et al.. (2020). On Gallai’s conjecture for graphs with maximum degree 6. Discrete Mathematics. 344(2). 112212–112212. 1 indexed citations
3.
Wang, Chao‐Hung, Yen-Yi Wu, Jianli Chen, et al.. (2017). An effective legalization algorithm for mixed-cell-height standard cells. 450–455. 39 indexed citations
4.
Chen, Jing & Genghua Fan. (2017). Short signed circuit covers of signed graphs. Discrete Applied Mathematics. 235. 51–58. 2 indexed citations
5.
Fan, Genghua, et al.. (2015). Fulkerson-covers of hypohamiltonian graphs. Discrete Applied Mathematics. 186. 66–73. 6 indexed citations
6.
Fan, Genghua, et al.. (2014). A bound for judiciousk-partitions of graphs. Discrete Applied Mathematics. 179. 86–99. 15 indexed citations
7.
Fan, Genghua, et al.. (2011). Upper bounds on minimum balanced bipartitions. Discrete Mathematics. 312(6). 1077–1083. 5 indexed citations
8.
Fan, Genghua, et al.. (2008). Nowhere-zero 3-flows in triangularly connected graphs. Journal of Combinatorial Theory Series B. 98(6). 1325–1336. 27 indexed citations
9.
Fan, Genghua. (2002). Subgraph Coverings and Edge Switchings. Journal of Combinatorial Theory Series B. 84(1). 54–83. 12 indexed citations
10.
Fan, Genghua & Baogang Xu. (2002). Hajós’ conjecture and projective graphs. Discrete Mathematics. 252(1-3). 91–101.
11.
Fan, Genghua & Cun‐Quan Zhang. (2000). Circuit Decompositions of Eulerian Graphs. Journal of Combinatorial Theory Series B. 78(1). 1–23. 6 indexed citations
12.
Fan, Genghua. (1998). Proofs of Two Minimum Circuit Cover Conjectures. Journal of Combinatorial Theory Series B. 74(2). 353–367. 6 indexed citations
13.
Fan, Genghua. (1997). Minimum cycle covers of graphs. Journal of Graph Theory. 25(3). 229–242. 2 indexed citations
14.
Fan, Genghua & H. A. Kierstead. (1996). Hamiltonian Square-Paths. Journal of Combinatorial Theory Series B. 67(2). 167–182. 27 indexed citations
15.
Fan, Genghua. (1993). Tutte′s 3-Flow Conjecture and Short Cycle Covers. Journal of Combinatorial Theory Series B. 57(1). 36–43. 7 indexed citations
16.
Fan, Genghua. (1992). Integer flows and cycle covers. Journal of Combinatorial Theory Series B. 54(1). 113–122. 22 indexed citations
17.
Bauer, Douglas C., Genghua Fan, & H.J. Veldman. (1991). Hamiltonian properties of graphs with large neighborhood unions. Discrete Mathematics. 96(1). 33–49. 22 indexed citations
18.
Fan, Genghua. (1990). Long cycles and the codiameter of a graph, I. Journal of Combinatorial Theory Series B. 49(2). 151–180. 8 indexed citations
19.
Fan, Genghua. (1987). On diameter 2-critical graphs. Discrete Mathematics. 67(3). 235–240. 25 indexed citations
20.
Fan, Genghua. (1984). New sufficient conditions for cycles in graphs. Journal of Combinatorial Theory Series B. 37(3). 221–227. 115 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

Rankless by CCL
2026