Guantao Chen

Orcid: 0000-0002-3118-6632

According to our database1, Guantao Chen authored at least 141 papers between 1990 and 2024.

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



In proceedings 
PhD thesis 




Decreasing the mean subtree order by adding <i>k</i> edges.
J. Graph Theory, March, 2024

A decomposition method on solving the linear arboricity conjecture.
J. Graph Theory, February, 2024

Linear arboricity of degenerate graphs.
J. Graph Theory, October, 2023

On Gupta's Codensity Conjecture.
SIAM J. Discret. Math., September, 2023

Local Dirac's condition on the existence of 2-factor.
Discret. Math., July, 2023

Double Vizing fans in critical class two graphs.
J. Graph Theory, May, 2023

Spanning trees with at most k leaves in 2-connected K1,r-free graphs.
Appl. Math. Comput., May, 2023

On the coequal values of total chromatic number and chromatic index.
J. Comb. Theory B, 2023

Unions of perfect matchings in <i>r</i>-graphs.
Discret. Math., 2023

The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree.
SIAM J. Discret. Math., September, 2022

Multithreshold multipartite graphs.
J. Graph Theory, 2022

Independence number of edge-chromatic critical graphs.
J. Graph Theory, 2022

A note on Goldberg's conjecture on total chromatic numbers.
J. Graph Theory, 2022

Overfullness of critical class 2 graphs with a small core degree.
J. Comb. Theory B, 2022

An improvement to the Hilton-Zhao vertex-splitting conjecture.
Discret. Math., 2022

Multiplicity of the second-largest eigenvalue of a planar graph.
J. Graph Theory, 2021

The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs.
J. Graph Theory, 2021

Laminar tight cuts in matching covered graphs.
J. Comb. Theory B, 2021

On the average degree of edge chromatic critical graphs.
J. Comb. Theory B, 2021

Improved bounds on the Ramsey number of fans.
Eur. J. Comb., 2021

The conjunction of the linear arboricity conjecture and Lovász's path partition theorem.
Discret. Math., 2021

Ring graphs and Goldberg's bound on chromatic index.
J. Graph Theory, 2020

On the average degree of edge chromatic critical graphs II.
J. Comb. Theory B, 2020

The Chromatic Number of Graphs with No Induced Subdivision of K<sub>4</sub>.
Graphs Comb., 2020

Spanning bipartite graphs with high degree sum in graphs.
Discret. Math., 2020

Hamiltonicity of edge-chromatic critical graphs.
Discret. Math., 2020

Dirac's Condition for Spanning Halin Subgraphs.
SIAM J. Discret. Math., 2019

Disjoint Odd Cycles in Cubic Solid Bricks.
SIAM J. Discret. Math., 2019

Structural properties of edge-chromatic critical multigraphs.
J. Comb. Theory B, 2019

Extremal Union-Closed Set Families.
Graphs Comb., 2019

Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw.
Graphs Comb., 2019

Graph Edge Coloring: A Survey.
Graphs Comb., 2019

Average degrees of edge-chromatic critical graphs.
Discret. Math., 2019

Chromatic index determined by fractional chromatic index.
J. Comb. Theory B, 2018

Cycles with a chord in dense graphs.
Discret. Math., 2018

Plane Triangulations Without a Spanning Halin Subgraph II.
SIAM J. Discret. Math., 2017

Vizing's 2-Factor Conjecture Involving Large Maximum Degree.
J. 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 Comb., 2017

Spanning Trails with Maximum Degree at Most 4 in 2K<sub>2</sub> -Free Graphs.
Graphs Comb., 2017

Nonempty intersection of longest paths in series-parallel graphs.
Discret. Math., 2017

Hamiltonicity of edge chromatic critical graphs.
Discret. Math., 2017

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

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

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

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

Characterizing Forbidden Pairs for Hamiltonian Squares.
Graphs Comb., 2015

An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.
Graphs Comb., 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

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

Degree Conditions for Spanning Brooms.
J. Graph Theory, 2014

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

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

The circumference of a graph with no K<sub>3, t</sub>-minor, II.
J. Comb. Theory B, 2012

Hamiltonian cycles with all small even chords.
Discret. Math., 2012

Endpoint extendable paths in dense graphs.
Discret. Math., 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discret. Math., 2012

Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs.
Comb. Probab. Comput., 2012

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

Circumferences of <i>k</i>-connected graphs involving independence numbers.
J. Graph Theory, 2011

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

Toughness of <i>K<sub>a,t</sub></i>-Minor-Free Graphs.
Electron. J. Comb., 2011

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

Optimization Model and Algorithm Help to Screen and Treat Sexually Transmitted Diseases.
Int. J. Comput. Model. Algorithms Medicine, 2010

Path spectra for trees.
Discret. Math., 2010

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

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

Discret. Math., 2009

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

Non-path spectrum sets.
J. Graph Theory, 2008

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

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

Graphic sequences with a realization containing a complete multipartite subgraph.
Discret. Math., 2008

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

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

The neighborhood union of independent sets and hamiltonicity of graphs.
Discret. Math., 2007

Decomposition of bipartite graphs into special subgraphs.
Discret. Appl. Math., 2007

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

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

Hamiltonian graphs involving neighborhood unions.
J. Graph Theory, 2006

The circumference of a graph with no K<sub>3, t</sub>-minor.
J. Comb. Theory B, 2006

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

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

Graph minors and linkages.
J. Graph Theory, 2005

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

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

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

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

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

Linear forests and ordered cycles.
Discuss. Math. Graph Theory, 2004

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

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

On Ranks of Matrices Associated with Trees.
Graphs Comb., 2003

Graph Connectivity After Path Removal.
Comb., 2003

Fragile graphs with small independent cuts.
J. Graph Theory, 2002

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

A note on fragile graphs.
Discret. Math., 2002

The hamiltonicity of bipartite graphs involving neighborhood unions.
Discret. Math., 2002

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

Degree-Light-Free Graphs and Hamiltonian Cycles.
Graphs Comb., 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.
Australas. J Comb., 2001

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

2-factors in claw-free graphs.
Discuss. Math. Graph Theory, 2000

Clique covering the edges of a locally cobipartite graph.
Discret. Math., 2000

On 2-factors containing 1-factors in bipartite graphs.
Discret. Math., 1999

Tough enough chordal graphs are Hamiltonian.
Networks, 1998

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

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

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

Vertex colorings with a distance restriction.
Discret. Math., 1998

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

Mixed Ramsey numbers: total chromatic number versus stars.
Australas. J Comb., 1998

Graphs with given odd sets.
J. Graph Theory, 1997

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

Degree conditions for 2-factors.
J. Graph Theory, 1997

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

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

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

A special k-coloring for a connected k-chromatic graph.
Discret. Math., 1997

A result on C<sub>4</sub>-star Ramsey numbers.
Discret. Math., 1997

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

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

Essential independent sets and Hamiltonian cycles.
J. Graph Theory, 1996

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

Hamiltonicity for <i>K</i><sub>1, r</sub>-free graphs.
J. Graph Theory, 1995

The irredundant ramsey number <i>s</i>(3, 7).
J. Graph Theory, 1995

Hamiltonicity in balanced<i>k</i>-partite graphs.
Graphs Comb., 1995

Vertex disjoint cycles for star free graphs.
Australas. J Comb., 1995

Hamiltonian graphs with neighborhood intersections.
J. Graph Theory, 1994

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

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

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

Graphs with Linearly Bounded Ramsey Numbers.
J. Comb. Theory 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.
Discret. Math., 1993

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

Ramsey Problems With Bounded Degree Spread.
Comb. Probab. Comput., 1993

Hamiltonian graphs involving distances.
J. Graph Theory, 1992

One sufficient condition for hamiltonian graphs.
J. Graph Theory, 1990