default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGenghua Fan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j57]Yanan Chu, Genghua Fan, Chuixiang Zhou
:
Path decompositions of triangle-free graphs. Discret. Math. 345(7): 112866 (2022)- 2021
- [j56]Bo Bao, Rong Chen, Genghua Fan:
Circuit Covers of Signed Eulerian Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j55]Jing Chen, Genghua Fan:
Circuit k-covers of signed graphs. Discret. Appl. Math. 294: 41-54 (2021) - [j54]Yanan Chu, Genghua Fan, Qinghai Liu:
On Gallai's conjecture for graphs with maximum degree 6. Discret. Math. 344(2): 112212 (2021) - [j53]Yanan Chu, Genghua Fan, Chuixiang Zhou:
Decompositions of 6-Regular Bipartite Graphs into Paths of Length Six. Graphs Comb. 37(1): 263-269 (2021) - 2019
- [j52]Genghua Fan, Hongbi Jiang, Ping Li, Douglas B. West, Daqing Yang, Xuding Zhu:
Extensions of matroid covering and packing. Eur. J. Comb. 76: 117-122 (2019) - 2018
- [j51]Genghua Fan, Jianfeng Hou, Xingxing Yu:
Bisections of Graphs Without Short Cycles. Comb. Probab. Comput. 27(1): 44-59 (2018) - [j50]Jing Chen, Genghua Fan:
Short signed circuit covers of signed graphs. Discret. Appl. Math. 235: 51-58 (2018) - [j49]Jing Chen, Genghua Fan:
Large even factors of graphs. J. Comb. Optim. 35(1): 162-169 (2018) - 2017
- [j48]Genghua Fan:
Integer 4-Flows and Cycle Covers. Comb. 37(6): 1097-1112 (2017) - [j47]Genghua Fan, Jianfeng Hou:
Bounds for pairs in judicious partitioning of graphs. Random Struct. Algorithms 50(1): 59-70 (2017) - 2016
- [j46]Fuyuan Chen, Genghua Fan:
Maximum even factors of graphs. J. Comb. Theory B 119: 237-244 (2016) - 2015
- [j45]Fuyuan Chen, Genghua Fan:
Fulkerson-covers of hypohamiltonian graphs. Discret. Appl. Math. 186: 66-73 (2015) - [j44]Genghua Fan, Yan Li, Ning Song, Daqing Yang:
Decomposing a graph into pseudoforests with one having bounded degree. J. Comb. Theory B 115: 72-95 (2015) - [j43]Wenxing Zhu, Jianli Chen, Zheng Peng, Genghua Fan:
Nonsmooth Optimization Method for VLSI Global Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(4): 642-655 (2015) - 2014
- [j42]Genghua Fan, Yanmei Hong, Qinghai Liu:
Ore's condition for completely independent spanning trees. Discret. Appl. Math. 177: 95-100 (2014) - [j41]Genghua Fan, Jianfeng Hou, Qinghou Zeng:
A bound for judicious k-partitions of graphs. Discret. Appl. Math. 179: 86-99 (2014) - [j40]Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu:
Forbidden Subgraphs and 3-Colorings. SIAM J. Discret. Math. 28(3): 1226-1256 (2014) - 2013
- [j39]Genghua Fan:
The Erdős-Sós conjecture for spiders of large size. Discret. Math. 313(22): 2513-2517 (2013) - 2012
- [j38]Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou:
Upper bounds on minimum balanced bipartitions. Discret. Math. 312(6): 1077-1083 (2012) - 2009
- [j37]Genghua Fan, Naidan Ji:
Relative Length of Longest Paths and Cycles in 2-Connected Graphs. SIAM J. Discret. Math. 23(3): 1238-1248 (2009) - 2008
- [j36]Genghua Fan, Chuixiang Zhou:
Degree sum and nowhere-zero 3-flows. Discret. Math. 308(24): 6233-6240 (2008) - [j35]Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou:
Nowhere-zero 3-flows in triangularly connected graphs. J. Comb. Theory B 98(6): 1325-1336 (2008) - [j34]Genghua Fan, Chuixiang Zhou:
Ore Condition and Nowhere-Zero 3-Flows. SIAM J. Discret. Math. 22(1): 288-294 (2008) - 2007
- [j33]Genghua Fan, Lingli Sun:
The Erdös-Sós conjecture for spiders. Discret. Math. 307(23): 3055-3062 (2007) - 2005
- [j32]Genghua Fan:
Path decompositions and Gallai's conjecture. J. Comb. Theory B 93(2): 117-125 (2005) - 2004
- [j31]Genghua Fan:
Circular Chromatic Number and Mycielski Graphs. Comb. 24(1): 127-135 (2004) - [j30]Guantao Chen, Genghua Fan, Xingxing Yu:
Cycles in 4-connected planar graphs. Eur. J. Comb. 25(6): 763-780 (2004) - [j29]Genghua Fan, Xuezheng Lv, Pei Wang:
Cycles in 2-connected graphs. J. Comb. Theory B 92(2): 379-394 (2004) - 2003
- [j28]Genghua Fan:
Covers of eulerian graphs. J. Comb. Theory B 89(2): 173-187 (2003) - 2002
- [j27]Genghua Fan, Baogang Xu:
Hajós' conjecture and projective graphs. Discret. Math. 252(1-3): 91-101 (2002) - [j26]Genghua Fan:
Subgraph Coverings and Edge Switchings. J. Comb. Theory B 84(1): 54-83 (2002) - [j25]Genghua Fan:
Distribution of Cycle Lengths in Graphs. J. Comb. Theory B 84(2): 187-202 (2002) - 2001
- [j24]Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. Electron. J. Comb. 8(1) (2001) - 2000
- [j23]Genghua Fan, Cun-Quan Zhang:
Circuit Decompositions of Eulerian Graphs. J. Comb. Theory B 78(1): 1-23 (2000) - 1998
- [j22]Genghua Fan:
Proofs of Two Minimum Circuit Cover Conjectures. J. Comb. Theory B 74(2): 353-367 (1998) - 1997
- [j21]Genghua Fan:
Extensions of Flow Theorems. J. Comb. Theory B 69(2): 110-124 (1997) - [j20]Genghua Fan:
Minimum cycle covers of graphs. J. Graph Theory 25(3): 229-242 (1997) - 1996
- [j19]Genghua Fan, Henry A. Kierstead:
Hamiltonian Square-Paths. J. Comb. Theory B 67(2): 167-182 (1996) - [j18]Genghua Fan, Hal A. Kierstead:
Partitioning a graph into two square-cycles. J. Graph Theory 23(3): 241-256 (1996) - 1995
- [j17]Genghua Fan, Henry A. Kierstead:
The Square of Paths and Cycles. J. Comb. Theory B 63(1): 55-64 (1995) - [j16]Genghua Fan:
Circuit Coverings of Graphs and a Conjecture of Pyber. J. Comb. Theory B 65(1): 1-6 (1995) - [j15]Genghua Fan:
Path covers of weighted graphs. J. Graph Theory 19(1): 131-136 (1995) - 1994
- [j14]Genghua Fan, André Raspaud:
Fulkerson's Conjecture and Circuit Covers. J. Comb. Theory B 61(1): 133-138 (1994) - [j13]Genghua Fan:
Short cycle covers of cubic graphs. J. Graph Theory 18(2): 131-141 (1994) - [j12]Genghua Fan, Roland Häggkvist:
The Square of a Hamiltonian Cycle. SIAM J. Discret. Math. 7(2): 203-212 (1994) - 1993
- [j11]Genghua Fan:
Tutte's 3-Flow Conjecture and Short Cycle Covers. J. Comb. Theory B 57(1): 36-43 (1993) - 1992
- [j10]Genghua Fan:
Integer flows and cycle covers. J. Comb. Theory B 54(1): 113-122 (1992) - [j9]Genghua Fan:
Covering Graphs by Cycles. SIAM J. Discret. Math. 5(4): 491-496 (1992) - 1991
- [j8]J. Adrian Bondy, Genghua Fan:
Cycles in weighted graphs. Comb. 11(3): 191-205 (1991) - [j7]Douglas Bauer, Genghua Fan, Henk Jan Veldman:
Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. 96(1): 33-49 (1991) - 1990
- [j6]Genghua Fan:
Covering weighted graphs by even subgraphs. J. Comb. Theory B 49(1): 137-141 (1990) - [j5]Genghua Fan:
Long cycles and the codiameter of a graph, I. J. Comb. Theory B 49(2): 151-180 (1990) - 1988
- [j4]Genghua Fan:
Degree sum for a triangle in a graph. J. Graph Theory 12(2): 249-263 (1988) - 1987
- [j3]J. Adrian Bondy, Genghua Fan:
A sufficient condition for dominating cycles. Discret. Math. 67(2): 205-208 (1987) - [j2]Genghua Fan:
On diameter 2-critical graphs. Discret. Math. 67(3): 235-240 (1987) - 1985
- [j1]Genghua Fan:
Longest cycles in regular graphs. J. Comb. Theory B 39(3): 325-345 (1985)
Conference and Workshop Papers
- 2017
- [c1]Chao-Hung Wang, Yen-Yi Wu, Jianli Chen, Yao-Wen Chang, Sy-Yen Kuo, Wenxing Zhu, Genghua Fan:
An effective legalization algorithm for mixed-cell-height standard cells. ASP-DAC 2017: 450-455
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
