Genghua Fan - RankMe

61 papers Journal 60Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bidirected trails and integral flows on bidirected graphs. Discret. Math. Jing Chen, Genghua Fan
2026	J	`jnl`	Gallai's conjecture and the path number of odd semi-cliques. Discret. Math. Yanan Chu, Genghua Fan, Chuixiang Zhou
2025	J	`jnl`	Hoffmann-Ostenhof's 3-Decomposition Conjecture. Discret. Math. Genghua Fan, Chuixiang Zhou
2022	J	`jnl`	Path decompositions of triangle-free graphs. Discret. Math. Yanan Chu, Genghua Fan, Chuixiang Zhou
2021	J	`jnl`	Circuit Covers of Signed Eulerian Graphs. Electron. J. Comb. Bo Bao, Rong Chen, Genghua Fan
2021	J	`jnl`	Circuit k-covers of signed graphs. Discret. Appl. Math. Jing Chen, Genghua Fan
2021	J	`jnl`	Decompositions of 6-Regular Bipartite Graphs into Paths of Length Six. Graphs Comb. Yanan Chu, Genghua Fan, Chuixiang Zhou
2021	J	`jnl`	On Gallai's conjecture for graphs with maximum degree 6. Discret. Math. Yanan Chu, Genghua Fan, Qinghai Liu
2019	J	`jnl`	Extensions of matroid covering and packing. Eur. J. Comb. Genghua Fan, Hongbi Jiang, Ping Li, Douglas B. West, Daqing Yang, Xuding Zhu
2018	J	`jnl`	Bisections of Graphs Without Short Cycles. Comb. Probab. Comput. Genghua Fan, Jianfeng Hou, Xingxing Yu
2018	J	`jnl`	Large even factors of graphs. J. Comb. Optim. Jing Chen, Genghua Fan
2018	J	`jnl`	Short signed circuit covers of signed graphs. Discret. Appl. Math. Jing Chen, Genghua Fan
2017	—	`conf`	An effective legalization algorithm for mixed-cell-height standard cells. ASP-DAC Chao-Hung Wang, Yen-Yi Wu, Jianli Chen, Yao-Wen Chang, Sy-Yen Kuo, Wenxing Zhu, Genghua Fan
2017	J	`jnl`	Bounds for pairs in judicious partitioning of graphs. Random Struct. Algorithms Genghua Fan, Jianfeng Hou
2017	J	`jnl`	Integer 4-Flows and Cycle Covers. Comb. Genghua Fan
2016	J	`jnl`	Maximum even factors of graphs. J. Comb. Theory B Fuyuan Chen, Genghua Fan
2015	J	`jnl`	Decomposing a graph into pseudoforests with one having bounded degree. J. Comb. Theory B Genghua Fan, Yan Li, Ning Song, Daqing Yang
2015	J	`jnl`	Fulkerson-covers of hypohamiltonian graphs. Discret. Appl. Math. Fuyuan Chen, Genghua Fan
2015	J	`jnl`	Nonsmooth Optimization Method for VLSI Global Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Wenxing Zhu, Jianli Chen, Zheng Peng, Genghua Fan
2014	J	`jnl`	A bound for judicious k-partitions of graphs. Discret. Appl. Math. Genghua Fan, Jianfeng Hou, Qinghou Zeng
2014	J	`jnl`	Forbidden Subgraphs and 3-Colorings. SIAM J. Discret. Math. Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu
2014	J	`jnl`	Ore's condition for completely independent spanning trees. Discret. Appl. Math. Genghua Fan, Yanmei Hong, Qinghai Liu
2013	J	`jnl`	The Erdős-Sós conjecture for spiders of large size. Discret. Math. Genghua Fan
2012	J	`jnl`	Upper bounds on minimum balanced bipartitions. Discret. Math. Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou
2009	J	`jnl`	Relative Length of Longest Paths and Cycles in 2-Connected Graphs. SIAM J. Discret. Math. Genghua Fan, Naidan Ji
2008	J	`jnl`	Degree sum and nowhere-zero 3-flows. Discret. Math. Genghua Fan, Chuixiang Zhou
2008	J	`jnl`	Nowhere-zero 3-flows in triangularly connected graphs. J. Comb. Theory B Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou
2008	J	`jnl`	Ore Condition and Nowhere-Zero 3-Flows. SIAM J. Discret. Math. Genghua Fan, Chuixiang Zhou
2007	J	`jnl`	The Erdös-Sós conjecture for spiders. Discret. Math. Genghua Fan, Lingli Sun
2005	J	`jnl`	Path decompositions and Gallai's conjecture. J. Comb. Theory B Genghua Fan
2004	J	`jnl`	Circular Chromatic Number and Mycielski Graphs. Comb. Genghua Fan
2004	J	`jnl`	Cycles in 2-connected graphs. J. Comb. Theory B Genghua Fan, Xuezheng Lv, Pei Wang
2004	J	`jnl`	Cycles in 4-connected planar graphs. Eur. J. Comb. Guantao Chen, Genghua Fan, Xingxing Yu
2003	J	`jnl`	Covers of eulerian graphs. J. Comb. Theory B Genghua Fan
2002	J	`jnl`	Distribution of Cycle Lengths in Graphs. J. Comb. Theory B Genghua Fan
2002	J	`jnl`	Hajós' conjecture and projective graphs. Discret. Math. Genghua Fan, Baogang Xu
2002	J	`jnl`	Subgraph Coverings and Edge Switchings. J. Comb. Theory B Genghua Fan
2001	J	`jnl`	Spanning Trees of Bounded Degree. Electron. J. Comb. Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
2000	J	`jnl`	Circuit Decompositions of Eulerian Graphs. J. Comb. Theory B Genghua Fan, Cun-Quan Zhang
1998	J	`jnl`	Proofs of Two Minimum Circuit Cover Conjectures. J. Comb. Theory B Genghua Fan
1997	J	`jnl`	Extensions of Flow Theorems. J. Comb. Theory B Genghua Fan
1997	J	`jnl`	Minimum cycle covers of graphs. J. Graph Theory Genghua Fan
1996	J	`jnl`	Hamiltonian Square-Paths. J. Comb. Theory B Genghua Fan, Henry A. Kierstead
1996	J	`jnl`	Partitioning a graph into two square-cycles. J. Graph Theory Genghua Fan, Hal A. Kierstead
1995	J	`jnl`	Circuit Coverings of Graphs and a Conjecture of Pyber. J. Comb. Theory B Genghua Fan
1995	J	`jnl`	Path covers of weighted graphs. J. Graph Theory Genghua Fan
1995	J	`jnl`	The Square of Paths and Cycles. J. Comb. Theory B Genghua Fan, Henry A. Kierstead
1994	J	`jnl`	Fulkerson's Conjecture and Circuit Covers. J. Comb. Theory B Genghua Fan, André Raspaud
1994	J	`jnl`	Short cycle covers of cubic graphs. J. Graph Theory Genghua Fan
1994	J	`jnl`	The Square of a Hamiltonian Cycle. SIAM J. Discret. Math. Genghua Fan, Roland Häggkvist
1993	J	`jnl`	Tutte's 3-Flow Conjecture and Short Cycle Covers. J. Comb. Theory B Genghua Fan
1992	J	`jnl`	Covering Graphs by Cycles. SIAM J. Discret. Math. Genghua Fan
1992	J	`jnl`	Integer flows and cycle covers. J. Comb. Theory B Genghua Fan
1991	J	`jnl`	Cycles in weighted graphs. Comb. J. Adrian Bondy, Genghua Fan
1991	J	`jnl`	Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. Douglas Bauer, Genghua Fan, Henk Jan Veldman
1990	J	`jnl`	Covering weighted graphs by even subgraphs. J. Comb. Theory B Genghua Fan
1990	J	`jnl`	Long cycles and the codiameter of a graph, I. J. Comb. Theory B Genghua Fan
1988	J	`jnl`	Degree sum for a triangle in a graph. J. Graph Theory Genghua Fan
1987	J	`jnl`	A sufficient condition for dominating cycles. Discret. Math. J. Adrian Bondy, Genghua Fan
1987	J	`jnl`	On diameter 2-critical graphs. Discret. Math. Genghua Fan
1985	J	`jnl`	Longest cycles in regular graphs. J. Comb. Theory B Genghua Fan