Guantao Chen

According to our database1, Guantao Chen
  • authored at least 105 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Vizing's 2-Factor Conjecture Involving Large Maximum Degree.
Journal of Graph Theory, 2017

Equitable vertex arboricity of 5-degenerate graphs.
J. Comb. Optim., 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.
Graphs and Combinatorics, 2017

Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs.
Graphs and Combinatorics, 2017

Nonempty intersection of longest paths in series-parallel graphs.
Discrete Mathematics, 2017

Hamiltonicity of edge chromatic critical graphs.
Discrete Mathematics, 2017

2016
Bayesian Inference for Functional Dynamics Exploring in fMRI Data.
Comp. Math. Methods in Medicine, 2016

2015
Disjoint Chorded Cycles of the Same Length.
SIAM J. Discrete Math., 2015

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.
SIAM J. Discrete Math., 2015

Hadwiger's conjecture for degree sequences.
J. Comb. Theory, Ser. B, 2015

Characterizing Forbidden Pairs for Hamiltonian Squares.
Graphs and Combinatorics, 2015

An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.
Graphs and Combinatorics, 2015

Dynamic Bayesian brain network partition and connectivity change point detection.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

2014
On Maximum Edge Cuts of Connected Digraphs.
Journal of Graph Theory, 2014

Degree Conditions for Spanning Brooms.
Journal of Graph Theory, 2014

2013
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition.
SIAM J. Discrete Math., 2013

Homeomorphically irreducible spanning trees.
J. Comb. Theory, Ser. B, 2013

2012
The circumference of a graph with no K3, t-minor, II.
J. Comb. Theory, Ser. B, 2012

Hamiltonian cycles with all small even chords.
Discrete Mathematics, 2012

Endpoint extendable paths in dense graphs.
Discrete Mathematics, 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discrete Mathematics, 2012

Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs.
Combinatorics, Probability & Computing, 2012

2011
Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks.
IEEE Trans. Parallel Distrib. Syst., 2011

Circumferences of k-connected graphs involving independence numbers.
Journal of Graph Theory, 2011

Approximating the chromatic index of multigraphs.
J. Comb. Optim., 2011

Toughness of Ka,t-Minor-Free Graphs.
Electr. J. Comb., 2011

2010
Transitive partitions in realizations of tournament score sequences.
Journal of Graph Theory, 2010

Optimization Model and Algorithm Help to Screen and Treat Sexually Transmitted Diseases.
IJCMAM, 2010

Path spectra for trees.
Discrete Mathematics, 2010

Efficient parallel algorithms for maximum-density segment problem.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Toric Geometry of Series-Parallel Graphs.
SIAM J. Discrete Math., 2009

Preface.
Discrete Mathematics, 2009

A universal framework for partial coverage in Wireless Sensor Networks.
Proceedings of the 28th International Performance Computing and Communications Conference, 2009

2008
Non-path spectrum sets.
Journal of Graph Theory, 2008

Linked graphs with restricted lengths.
J. Comb. Theory, Ser. B, 2008

Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces.
Graphs and Combinatorics, 2008

Graphic sequences with a realization containing a complete multipartite subgraph.
Discrete Mathematics, 2008

Saturation Numbers of Books.
Electr. J. Comb., 2008

2007
Chvátal Erdós condition and 2-factors with a specyfied number of components.
Discussiones Mathematicae Graph Theory, 2007

The neighborhood union of independent sets and hamiltonicity of graphs.
Discrete Mathematics, 2007

Decomposition of bipartite graphs into special subgraphs.
Discrete Applied Mathematics, 2007

2006
Cycle Extendability of Hamiltonian Interval Graphs.
SIAM J. Discrete Math., 2006

Approximating Longest Cycles in Graphs with Bounded Degrees.
SIAM J. Comput., 2006

Hamiltonian graphs involving neighborhood unions.
Journal of Graph Theory, 2006

The circumference of a graph with no K3, t-minor.
J. Comb. Theory, Ser. B, 2006

Characterization of [1, k]-Bar Visibility Trees.
Electr. J. Comb., 2006

Cysteine separations profiles on protein secondary structure infer disulfide connectivity.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

2005
Graph minors and linkages.
Journal of Graph Theory, 2005

Approximating the Longest Cycle Problem on Graphs with Bounded Degree.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
An Interlacing Result on Normalized Laplacians.
SIAM J. Discrete Math., 2004

Circumference of Graphs with Bounded Degree.
SIAM J. Comput., 2004

Vertex-disjoint cycles containing specified vertices in a bipartite graph.
Journal of Graph Theory, 2004

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

Linear forests and ordered cycles.
Discussiones Mathematicae Graph Theory, 2004

New Conditions for k-ordered Hamiltonian Graphs.
Ars Comb., 2004

2003
Extremal graphs for intersecting cliques.
J. Comb. Theory, Ser. B, 2003

On Ranks of Matrices Associated with Trees.
Graphs and Combinatorics, 2003

Graph Connectivity After Path Removal.
Combinatorica, 2003

2002
Fragile graphs with small independent cuts.
Journal of Graph Theory, 2002

Long Cycles in 3-Connected Graphs.
J. Comb. Theory, Ser. B, 2002

A note on fragile graphs.
Discrete Mathematics, 2002

The hamiltonicity of bipartite graphs involving neighborhood unions.
Discrete Mathematics, 2002

2001
Partitioning Vertices of a Tournament into Independent Cycles.
J. Comb. Theory, Ser. B, 2001

Degree-Light-Free Graphs and Hamiltonian Cycles.
Graphs and Combinatorics, 2001

Degree Sequences with Repeated Values.
Ars Comb., 2001

Weak Clique-Covering Cycles and Paths.
Ars Comb., 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.
Australasian J. Combinatorics, 2001

2000
Cycles in 2-Factors of Balanced Bipartite Graphs.
Graphs and Combinatorics, 2000

2-factors in claw-free graphs.
Discussiones Mathematicae Graph Theory, 2000

Clique covering the edges of a locally cobipartite graph.
Discrete Mathematics, 2000

1999
On 2-factors containing 1-factors in bipartite graphs.
Discrete Mathematics, 1999

1998
Tough enough chordal graphs are Hamiltonian.
Networks, 1998

Star-factors of tournaments.
Journal of Graph Theory, 1998

Note on graphs without repeated cycle lengths.
Journal of Graph Theory, 1998

Intersections of Longest Cycles in k-Connected Graphs.
J. Comb. Theory, Ser. B, 1998

Vertex colorings with a distance restriction.
Discrete Mathematics, 1998

Note on Whitney's Theorem for k-connected Graphs.
Ars Comb., 1998

Mixed Ramsey numbers: total chromatic number versus stars.
Australasian J. Combinatorics, 1998

1997
Graphs with given odd sets.
Journal of Graph Theory, 1997

Special monochromatic trees in two-colored complete graphs.
Journal of Graph Theory, 1997

Degree conditions for 2-factors.
Journal of Graph Theory, 1997

Degree Sum Conditions for Hamiltonicity on k-Partite Graphs.
Graphs and Combinatorics, 1997

A Class of Edge Critical 4-Chromatic Graphs.
Graphs and Combinatorics, 1997

A New Game Chromatic Number.
Eur. J. Comb., 1997

A special k-coloring for a connected k-chromatic graph.
Discrete Mathematics, 1997

A result on C4-star Ramsey numbers.
Discrete Mathematics, 1997

Hamiltonian Graphs with Large Neighborhood Unions.
Ars Comb., 1997

1996
A partition approach to Vizing's conjecture.
Journal of Graph Theory, 1996

Essential independent sets and Hamiltonian cycles.
Journal of Graph Theory, 1996

Proof of a Conjecture of Bollob's on Nested Cycles.
J. Comb. Theory, Ser. B, 1996

1995
Hamiltonicity for K1, r-free graphs.
Journal of Graph Theory, 1995

The irredundant ramsey number s(3, 7).
Journal of Graph Theory, 1995

Hamiltonicity in balancedk-partite graphs.
Graphs and Combinatorics, 1995

Vertex disjoint cycles for star free graphs.
Australasian J. Combinatorics, 1995

1994
Hamiltonian graphs with neighborhood intersections.
Journal of Graph Theory, 1994

Neighborhood unions and the cycle cover number of a graph.
Journal of Graph Theory, 1994

Graphs with a Cycle of Length Divisible by Three.
J. Comb. Theory, Ser. B, 1994

1993
Asymptotic bounds for irredundant and mixed Ramsey numbers.
Journal of Graph Theory, 1993

Graphs with Linearly Bounded Ramsey Numbers.
J. Comb. Theory, Ser. B, 1993

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.
Eur. J. Comb., 1993

Hamiltonian graphs involving neighborhood intersections.
Discrete Mathematics, 1993

A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness.
Discrete Mathematics, 1993

Ramsey Problems With Bounded Degree Spread.
Combinatorics, Probability & Computing, 1993

1992
Hamiltonian graphs involving distances.
Journal of Graph Theory, 1992

1990
One sufficient condition for hamiltonian graphs.
Journal of Graph Theory, 1990


  Loading...