Genghua Fan

According to our database1, Genghua Fan authored at least 57 papers between 1985 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Decompositions of 6-Regular Bipartite Graphs into Paths of Length Six.
Graphs Comb., 2021

On Gallai's conjecture for graphs with maximum degree 6.
Discret. Math., 2021

Circuit k-covers of signed graphs.
Discret. Appl. Math., 2021

Circuit Covers of Signed Eulerian Graphs.
Electron. J. Comb., 2021

2019
Extensions of matroid covering and packing.
Eur. J. Comb., 2019

2018
Large even factors of graphs.
J. Comb. Optim., 2018

Short signed circuit covers of signed graphs.
Discret. Appl. Math., 2018

Bisections of Graphs Without Short Cycles.
Comb. Probab. Comput., 2018

2017
Bounds for pairs in judicious partitioning of graphs.
Random Struct. Algorithms, 2017

Integer 4-Flows and Cycle Covers.
Comb., 2017

An effective legalization algorithm for mixed-cell-height standard cells.
Proceedings of the 22nd Asia and South Pacific Design Automation Conference, 2017

2016
Maximum even factors of graphs.
J. Comb. Theory, Ser. B, 2016

2015
Nonsmooth Optimization Method for VLSI Global Placement.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2015

Decomposing a graph into pseudoforests with one having bounded degree.
J. Comb. Theory, Ser. B, 2015

Fulkerson-covers of hypohamiltonian graphs.
Discret. Appl. Math., 2015

2014
Forbidden Subgraphs and 3-Colorings.
SIAM J. Discret. Math., 2014

A bound for judicious k-partitions of graphs.
Discret. Appl. Math., 2014

Ore's condition for completely independent spanning trees.
Discret. Appl. Math., 2014

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

2012
Upper bounds on minimum balanced bipartitions.
Discret. Math., 2012

2009
Relative Length of Longest Paths and Cycles in 2-Connected Graphs.
SIAM J. Discret. Math., 2009

2008
Ore Condition and Nowhere-Zero 3-Flows.
SIAM J. Discret. Math., 2008

Nowhere-zero 3-flows in triangularly connected graphs.
J. Comb. Theory, Ser. B, 2008

Degree sum and nowhere-zero 3-flows.
Discret. Math., 2008

2007
The Erdös-Sós conjecture for spiders.
Discret. Math., 2007

2005
Path decompositions and Gallai's conjecture.
J. Comb. Theory, Ser. B, 2005

2004
Cycles in 2-connected graphs.
J. Comb. Theory, Ser. B, 2004

Cycles in 4-connected planar graphs.
Eur. J. Comb., 2004

Circular Chromatic Number and Mycielski Graphs.
Comb., 2004

2003
Covers of eulerian graphs.
J. Comb. Theory, Ser. B, 2003

2002
Distribution of Cycle Lengths in Graphs.
J. Comb. Theory, Ser. B, 2002

Subgraph Coverings and Edge Switchings.
J. Comb. Theory, Ser. B, 2002

Hajós' conjecture and projective graphs.
Discret. Math., 2002

2001
Spanning Trees of Bounded Degree.
Electron. J. Comb., 2001

2000
Circuit Decompositions of Eulerian Graphs.
J. Comb. Theory, Ser. B, 2000

1998
Proofs of Two Minimum Circuit Cover Conjectures.
J. Comb. Theory, Ser. B, 1998

1997
Minimum cycle covers of graphs.
J. Graph Theory, 1997

Extensions of Flow Theorems.
J. Comb. Theory, Ser. B, 1997

1996
Partitioning a graph into two square-cycles.
J. Graph Theory, 1996

Hamiltonian Square-Paths.
J. Comb. Theory, Ser. B, 1996

1995
Path covers of weighted graphs.
J. Graph Theory, 1995

The Square of Paths and Cycles.
J. Comb. Theory, Ser. B, 1995

Circuit Coverings of Graphs and a Conjecture of Pyber.
J. Comb. Theory, Ser. B, 1995

1994
The Square of a Hamiltonian Cycle.
SIAM J. Discret. Math., 1994

Short cycle covers of cubic graphs.
J. Graph Theory, 1994

Fulkerson's Conjecture and Circuit Covers.
J. Comb. Theory, Ser. B, 1994

1993
Tutte's 3-Flow Conjecture and Short Cycle Covers.
J. Comb. Theory, Ser. B, 1993

1992
Covering Graphs by Cycles.
SIAM J. Discret. Math., 1992

Integer flows and cycle covers.
J. Comb. Theory, Ser. B, 1992

1991
Hamiltonian properties of graphs with large neighborhood unions.
Discret. Math., 1991

Cycles in weighted graphs.
Comb., 1991

1990
Long cycles and the codiameter of a graph, I.
J. Comb. Theory, Ser. B, 1990

Covering weighted graphs by even subgraphs.
J. Comb. Theory, Ser. B, 1990

1988
Degree sum for a triangle in a graph.
J. Graph Theory, 1988

1987
On diameter 2-critical graphs.
Discret. Math., 1987

A sufficient condition for dominating cycles.
Discret. Math., 1987

1985
Longest cycles in regular graphs.
J. Comb. Theory, Ser. B, 1985


  Loading...