Longest cycles in regular graphs. - Genghua Fan (J. Comb. Theory B, 1985)

A sufficient condition for dominating cycles. - J. Adrian Bondy; Genghua Fan (Discret. Math., 1987)

On diameter 2-critical graphs. - Genghua Fan (Discret. Math., 1987)

Degree sum for a triangle in a graph. - Genghua Fan (J. Graph Theory, 1988)

Covering weighted graphs by even subgraphs. - Genghua Fan (J. Comb. Theory B, 1990)

Long cycles and the codiameter of a graph, I. - Genghua Fan (J. Comb. Theory B, 1990)

Cycles in weighted graphs. - J. Adrian Bondy; Genghua Fan (Comb., 1991)

Hamiltonian properties of graphs with large neighborhood unions. - Douglas Bauer; Genghua Fan; Henk Jan Veldman (Discret. Math., 1991)

Integer flows and cycle covers. - Genghua Fan (J. Comb. Theory B, 1992)

Covering Graphs by Cycles. - Genghua Fan (SIAM J. Discret. Math., 1992)

Tutte's 3-Flow Conjecture and Short Cycle Covers. - Genghua Fan (J. Comb. Theory B, 1993)

Fulkerson's Conjecture and Circuit Covers. - Genghua Fan; André Raspaud (J. Comb. Theory B, 1994)

Short cycle covers of cubic graphs. - Genghua Fan (J. Graph Theory, 1994)

The Square of a Hamiltonian Cycle. - Genghua Fan; Roland Häggkvist (SIAM J. Discret. Math., 1994)

Circuit Coverings of Graphs and a Conjecture of Pyber. - Genghua Fan (J. Comb. Theory B, 1995)

The Square of Paths and Cycles. - Genghua Fan; Henry A. Kierstead (J. Comb. Theory B, 1995)

Path covers of weighted graphs. - Genghua Fan (J. Graph Theory, 1995)

Hamiltonian Square-Paths. - Genghua Fan; Henry A. Kierstead (J. Comb. Theory B, 1996)

Partitioning a graph into two square-cycles. - Genghua Fan; Hal A. Kierstead (J. Graph Theory, 1996)

Extensions of Flow Theorems. - Genghua Fan (J. Comb. Theory B, 1997)

Minimum cycle covers of graphs. - Genghua Fan (J. Graph Theory, 1997)

Proofs of Two Minimum Circuit Cover Conjectures. - Genghua Fan (J. Comb. Theory B, 1998)

Circuit Decompositions of Eulerian Graphs. - Genghua Fan; Cun-Quan Zhang (J. Comb. Theory B, 2000)

Spanning Trees of Bounded Degree. - Andrzej Czygrinow; Genghua Fan; Glenn Hurlbert; Henry A. Kierstead; William T. Trotter (Electron. J. Comb., 2001)

Hajós' conjecture and projective graphs. - Genghua Fan; Baogang Xu (Discret. Math., 2002)

Subgraph Coverings and Edge Switchings. - Genghua Fan (J. Comb. Theory B, 2002)

Distribution of Cycle Lengths in Graphs. - Genghua Fan (J. Comb. Theory B, 2002)

Covers of eulerian graphs. - Genghua Fan (J. Comb. Theory B, 2003)

Circular Chromatic Number and Mycielski Graphs. - Genghua Fan (Comb., 2004)

Cycles in 4-connected planar graphs. - Guantao Chen; Genghua Fan; Xingxing Yu (Eur. J. Comb., 2004)

Cycles in 2-connected graphs. - Genghua Fan; Xuezheng Lv; Pei Wang (J. Comb. Theory B, 2004)

Path decompositions and Gallai's conjecture. - Genghua Fan (J. Comb. Theory B, 2005)

The Erdös-Sós conjecture for spiders. - Genghua Fan; Lingli Sun (Discret. Math., 2007)

Degree sum and nowhere-zero 3-flows. - Genghua Fan; Chuixiang Zhou (Discret. Math., 2008)

Nowhere-zero 3-flows in triangularly connected graphs. - Genghua Fan; Hong-Jian Lai; Rui Xu 023; Cun-Quan Zhang; Chuixiang Zhou (J. Comb. Theory B, 2008)

Ore Condition and Nowhere-Zero 3-Flows. - Genghua Fan; Chuixiang Zhou (SIAM J. Discret. Math., 2008)

Relative Length of Longest Paths and Cycles in 2-Connected Graphs. - Genghua Fan; Naidan Ji (SIAM J. Discret. Math., 2009)

Upper bounds on minimum balanced bipartitions. - Genghua Fan; Baogang Xu; Xingxing Yu; Chuixiang Zhou (Discret. Math., 2012)

The Erdős-Sós conjecture for spiders of large size. - Genghua Fan (Discret. Math., 2013)

Ore's condition for completely independent spanning trees. - Genghua Fan; Yanmei Hong; Qinghai Liu (Discret. Appl. Math., 2014)

A bound for judicious k-partitions of graphs. - Genghua Fan; Jianfeng Hou; Qinghou Zeng (Discret. Appl. Math., 2014)

Forbidden Subgraphs and 3-Colorings. - Genghua Fan; Baogang Xu; Tianjun Ye; Xingxing Yu (SIAM J. Discret. Math., 2014)

Fulkerson-covers of hypohamiltonian graphs. - Fuyuan Chen; Genghua Fan (Discret. Appl. Math., 2015)

Decomposing a graph into pseudoforests with one having bounded degree. - Genghua Fan; Yan Li; Ning Song; Daqing Yang (J. Comb. Theory B, 2015)

Nonsmooth Optimization Method for VLSI Global Placement. - Wenxing Zhu; Jianli Chen; Zheng Peng 002; Genghua Fan (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2015)

Maximum even factors of graphs. - Fuyuan Chen; Genghua Fan (J. Comb. Theory B, 2016)

An effective legalization algorithm for mixed-cell-height standard cells. - Chao-Hung Wang; Yen-Yi Wu; Jianli Chen; Yao-Wen Chang; Sy-Yen Kuo; Wenxing Zhu; Genghua Fan (ASP-DAC, 2017)

Integer 4-Flows and Cycle Covers. - Genghua Fan (Comb., 2017)

Bounds for pairs in judicious partitioning of graphs. - Genghua Fan; Jianfeng Hou (Random Struct. Algorithms, 2017)

Bisections of Graphs Without Short Cycles. - Genghua Fan; Jianfeng Hou; Xingxing Yu (Comb. Probab. Comput., 2018)

Short signed circuit covers of signed graphs. - Jing Chen; Genghua Fan (Discret. Appl. Math., 2018)

Large even factors of graphs. - Jing Chen; Genghua Fan (J. Comb. Optim., 2018)

Extensions of matroid covering and packing. - Genghua Fan; Hongbi Jiang; Ping Li 025; Douglas B. West; Daqing Yang; Xuding Zhu (Eur. J. Comb., 2019)

Circuit Covers of Signed Eulerian Graphs. - Bo Bao; Rong Chen; Genghua Fan (Electron. J. Comb., 2021)

Circuit k-covers of signed graphs. - Jing Chen; Genghua Fan (Discret. Appl. Math., 2021)

On Gallai's conjecture for graphs with maximum degree 6. - Yanan Chu; Genghua Fan; Qinghai Liu (Discret. Math., 2021)

Decompositions of 6-Regular Bipartite Graphs into Paths of Length Six. - Yanan Chu; Genghua Fan; Chuixiang Zhou (Graphs Comb., 2021)

Path decompositions of triangle-free graphs. - Yanan Chu; Genghua Fan; Chuixiang Zhou (Discret. Math., 2022)

Hoffmann-Ostenhof's 3-Decomposition Conjecture. - Genghua Fan; Chuixiang Zhou (Discret. Math., 2025)

Gallai's conjecture and the path number of odd semi-cliques. - Yanan Chu; Genghua Fan; Chuixiang Zhou (Discret. Math., 2026)