Guantao Chen
Research Interests
Submitted
Precoloring extension of Vizing's Theorem for multigraphs (PDF)
with Yan Cao, Guangming Jing, Xuli Qi, and Songling Shan
Appeared
2021
Laminar tight cuts in matching covered graphs
J. Combin. Theory Ser. B, 150 (2021), 177194
with Xing Feng, Fuliang Lu, Cláudio L. Lucchesi and Lianzhu Zhang
The chromatic number of {ISK\(_4\), diamond, bowtie}free graphs
Journal of Graph Theory, 96 (2021), no. 4, 554577
with Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu
2020
Ring graphs and Goldberg's bound on chromatic index
Journal of Graph Theory, 93 (2020), no. 3, 440449
with Yan Cao, Shushan He and Guangming Jing
Hamiltonicity of edgechromatic critical graphs
Discrete Math, 343 (2020), no. 7, 111881
with Y. Cao, S. Jiang, H. Liu, and F. Lu
Spanning bipartite graphs with high degree sum in graphs
Discrete Math, 343 (2020), no. 2, 111663
with Shuya Chiba, Ronald Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, and Tomoki Yamashita
The chromatic number of graphs with no induced subdivision of \(K_4\)
Graphs and Combinatorics, 36 (2020), 719728
with Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu
2019
Graph Edge Coloring: A Survey
Graphs and Combinatorics
with Yan Cao, Guangming Jing, Michael Stiebitz, Bjarne Toft
Average degrees of edgechromatic critical graphs
Discrete Mathematics
with Yan Cao, Suyun Jiang, Huiqing Liu, Fuliang Lu
2018
Chromatic index determined by fractional chromatic index
J. Comb. Theory, Ser. B
Yuping Gao, Ringi Kim, Luke Postle, Songling Shan
2017
Forbidden Pairs and the Existence of a Spanning Halin Subgraph
Graphs and Combinatorics
with Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya
Equitable vertex arboricity of \(5\)degenerate graphs
J. Comb. Optim.
with Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu
Nonempty Intersection of Longest Paths in SeriesParallel Graphs
Discrete Mathematics
with J. Ehrenmuller, C.G. Fernander, C. Heise, S. Shan, P. Yang, A. Yates
2016
Bayesian Inference for Functional Dynamics Exploring in fMRI Data
Computational and Mathematical Methods in Medicine
with Xuan Guo, Bing Liu, Le Chen, Yi Pan and Jing Zhang
2015
Plane triangulations without spanning Halin subgraphs: Counter examples of LovászPlummer conjecture on Halin graphs
SIAM J. Discrete Math 29 (2015), no. 3, 14231426
with H. Enomoto, K. Ozeki, and S. Tsuchiya
Disjoint chorded cycles of the same length
SIAM J. Discrete Math. 29 (2015), no. 2, 10301041
with Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, and Songling Shan
An extension of the ChvatalErdős theorem: counting the number of maximum independent sets
Graphs and Combinatorics 31 (2015), no. 4, 885896
with Yinkui Li, Haicheng Ma, Tingzeng Wu, and Liming Xiong
2014
Degree conditions for spanning brooms
J. Graph Theory, 77 (2014), no. 3, 237250
with Michael Ferrara, Zhiquan Hu, Michael Jacobson and Huiqing Liu
Maximum cuts for connected digraphs
J. Graph Theory 76 (2014), no. 1, 119
with Manzang Gu, and Nana Li
Spanning \(3\)ended trees in \(k\)connected \(K_{1,4}\)free graphs
Sci. China Math. 57 (2014), no. 8, 15791586
with Yuan Chen and Zhiquan Hu
2013
2012
The circumference of a graph with no \(K_{3,t}\)minor II
J. Combin. Theory B, 102 (2012), no. 6, 12111240
with X. Yu and W. Zang
Hamilton cycles will all small even chords
Discrete Mathematics, 312 (2012), no. 6, 12261240
with Katsuhiro Ota, Akira Saito, and Yi Zhao
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
Combinatorics, Probability, and Computing, 21 (2012), no. 12, 107111
with H. Ren and S. Shan
Forbidden pairs for \(k\)connected Hamiltonian graphs
Discrete Math., 312 (2012), no, 6, 12261240 with Y. Egawa, R. Gould, A. Saito
Endpoint extendible paths in dense graphs
Discrete Math, 312 (2012), no. 17, 25842592 with Z. Hu and H. Li
Using a Resource Allocation Model to Better Guide Local Sexually Transmitted Diseases Control and Prevention Programs
Operations Research for Health Care, 1 (2012), Issues 23, 2329
with Thomas Gift, Guoyu Tao, and Kun Zhao
2011
Circumferences of \(k\)connected Graphs Involving Independence Numbers
J. Graph Theory, 68 (2011), no. 1, 5576
with Z. Hu and Y. Wu
Saturation numbers for families of Ramseyminimal graphs
Journal of Combin., 2 (2011), no. 3, 435455 with M. Ferrara, R. Gould, C. Magnant, J. Schmitt
Approximating the chromatic index of multigraphs
J. Comb. Optim., 21 (2011), no. 2, 219246
with X. Yu and W. Zang
Toughness of \(K_{a,t}\)minorfree graphs
Electron. J. Combin., 18 (2011), no. 1, Paper 148, 6 pp
with Y. Egawa, K. Kawarabayashi, B. Mohar, and K. Ota
Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks
IEEE Transactions on Distributed Systems, 22(2011) no. 4, 695703
with Yingshu Li, Chinh Vu, Yi Zhao
2010
Tournament score sequences with \(k\)transitive \(m\)partitionable realizations
J. Graph Theory, 64 (2010), no. 1, 5262
with A. Busch and M. Jacobson
Optimization Model and Algorithm Help to Screen and Treat Sexually Transmitted Diseases
Internat. J. Computational Models and Algorithms in Medicine, 1(2010), no. 4 118
with T. Gift, G. Tao, and K. Zhao
A Universal Framework for Partial Coverage in Wireless Sensor Networks
Performance Computing and Communications Conference, (IPCCC) 2009 IEEE 28th International, 10972641, 18
with Y. Li, C. Vu, and Y. Zhao
Efficient Parallel Algorithms for MaximumDensity Segment Problem
Parallel & Distributed Processing – the 24th IEEE International Symposium, 15302075, 19
with F. Qiu, S. Prasad, and X. Wang
Integration of diverse research methods to analyze and engineer \(C_a^{2+}\)binding proteins: From prediction to production
Curent Bioinformatics, 5, no. 1 (2010) 6880
with M. Kirberger, S. Tang, X. Wang, J. Yang, K. Zhao
Analysis and prediction of calcium binding pockets from apoprotein structures exhibiting calciuminduced localized conformational changes
Protein Science, 19, no. 6, (2010) 11801190
with M. Kirberger, X. Wang, H. Wong, J. Yang
2009
Towards Predicting C\(_a^{2+}\) –binding Sites with Different Coordination Numbers in Proteins with Atomic Resolution
Proteins: Bioinformatics, 75 (2009), no. 4, 78798
with M. Kirberger, F. Qiu, X. Wang, and J. Yang
Toric geometry of seriesparallel graphs
SIAM J. Discrete Math, 23 (2009), no. 2, 75464
with J. Brennan
2008
Linked graphs with restricted lengths
J. Combin. Theory Ser. B, 98 (2008), no. 4, 735751
with Y. Chen, S. Gao, and Z. Hu
Gauss{B}onnet formula, finiteness condition, and characterizations of graphs embedded in surfaces
Graphs Combin., 24 (2008), no. 3, 159183
with B. Chen
Nonpath spectrum sets
J. Graph Theory, 58 (2008), no. 4, 329–350
with R. Faudree, X. Li, and I. Schiermeyer
*Graphic sequences with a realization containing a complete multipartite subgraph
Discrete Math, 308 (2008) 571221
with M. Ferrara, R.J. Gould, J.R. Schmitt
Statistical Analysis of Structural Characteristics of Protein \(C_a^{2+}\) binding sites
J. Biological Inorganic Chemistry, 30 (2008), no. 29, 92607
with H. Deng, M. Kirberger, X. Wang, J. Yang, and W. Yang
Saturation Numbers of Books
Electron. J. Combin., 15 (2008), no. 1, Research Paper 118, 12 pp.
with R.J. Faudree and R.J. Gould
2007
The neighborhood union of independent sets and hamiltonicity of graphs
Discrete Math., 307 (2007), no. 1718, 2226–2234
with X. Li, Z. Wu, and X. Xu
Decomposition of bipartite graphs into special subgraphs
Discrete Applied Mathematics, 155 (2007), no. 3, 400–404
with R. Schelp
The ChvátalErdős condition and 2Factors with a specified number of components
Discussiones Mathematicae Graph Theory 27 (2007) no. 3, 401407
with R. Gould, K. Kawarabayashi, K. Ota, A. Saito, I. Schiermeyer
2006
Cycle extendabilty of hamiltonian interval graphs
SIAM J. Discrete Math., 20 (2006), no. 3, 682–689
with R. Faudree, R. Gould, and M. Jacobson
Circumferences of graphs with no \(K_{3,t}\)minors
J. Combin. Ser B, Vol. 96 (2006), no. 6, 822845
with L. Sheppardson, X. Yu, and W. Zang
Predicting Calcium Binding Sites in ProteinsA Graph Theory and Geometry Approach
Proteins: Structure, Function, and Bioinformatics 64 (2006) no. 1, 34–42
with H. Deng, W. Yang, and J. Yang
Approximating long cycles in graphs with bounded degrees
SIAM J. Comput. 36 (2006), no. 3, 635–656
with Z. Gao, W. Zang, and X. Yu
Characterizations of \([1,k]\)Bar Visibility Trees
Electron. J. Combin. 13 (2006), no. 1, Research Paper 90, 12 pp.
with J.P. Hutchison, K. Keating, J. Shen
Cysteine separations profiles on protein secondary structure infer disulfide connectivity
Proc. of IEEEGrC 2006 Atlanta, GA, May, 2006
with H. Deng, Y. Gui, Y. Pan, and X. Wang
2005
Graph minors and linkages
J. of Graph Theory, 49 (2005), no. 1, 75–91.
with R. Gould, K. Kawarabayashi, F. Pfender, B. Wei
Approximating the Longest Cycle Problem on Graphs with Bounded Degree
Lecture Notes in Computer Science, Vol. 3595/2005, 870–884.
with Z. Gao, X. Yu, and W. Zang
2004
Rescreening women who test positive for C. trachomatis infection: an integer programming to determine numbers of women cured under fixed program budgets
Health Care Management Science, 7 (2004), 135144
with G. Tao, B. Abban, and T. Gift
Vertexdisjoint cycles containing specified vertices in a bipartite graph
J. of Graph Theory, 46 (2004), no. 3, 145166.
with H. Enomoto, K. Kawarabayashi, K. Ota, D. Lou, and A. Saito
An interlacing result on normalized laplacians
SIAM J. Discrete Math. 18 (2004), no. 2, 353–361.
with G. Davis, F. Hall, Z. Li, K. Patel, and M. Stewart
Linear forests and ordered cycles
Discuss. Math. Graph Theory 24 (2004), no. 3, 359–372.
with R. Faudree, R. Gould, M. Jacobson, L. Lesniak, and F. Pfender
2003
Extremal graphs for intersecting cliques
J. Combin. Theory Ser. B, 89 (2003), no. 2, 159171.
with R.J. Gould, Florian Pfender, and Bing Wei
Graph connectivity after path removal
Combinatorica, 23 (2003), no. 2, 185203.
with R.J. Gould and X. Yu
On ranks of matrices associated with trees
Graphs Combin., 19 (2003), no. 3, 323–334.
with F. Hall, B. Wei, and Z. Li
2002
The hamiltonicity of bipartite graphs involving neighborhood unions
Discrete Math, 249 (2002), no. 13, 4556
with A. Saito, B. Wei, and X. Zhang
Fragile graphs with small independent cuts
J. Graph Theory, 41 (2002), no. 4, 327341
with R. Faudree and M. Jacobson
2001
Partitioning vertices of a tournament into independent cycles
J. Combin. Theory Ser. B, 83 (2001), no. 2, 213220
with R. Gould and H. Li
Degreelightfree graphs and Hamiltonian cycles
Graphs Combin., 17 (2001), no. 3, 409–434
with B. Wei and X. Zhang
Vertexdisjoint cycles containing specified edges
in a bipartite graph
Australas. J. Combin., 23 (2001), 3748.
with H. Enomoto, K. Kawarabayashi, K. Ota, D. Lou, and A. Saito
Degree sequences with repeated values
Ars Combin., 59 (2001), 3344.
with J. Hutchinson, W. Piotrowski, W. Shreve, B. Wei
Isomorphisms involving reversing arcs of digraphs
J. Combin. Math. Combin. Comput., 36 (2001), 155160
with F. Hall, A. Kezdy, Z. Li, and H. Zhou
2000
Cliques covering the edges of a locally cobipartite Graphs
Discrete Math, 219 (2000), no. 13, 1726
with M. Jacobson, A. Kézdy, J. Lehel, E. Scheinerman, C. Wang
Cycles in \(2\)factors of balanced bipartite graphs
Graphs Combin., 16 (2000), 6780
with R. Faudree, R. Gould, M. Jacobson, and L. Lesniak
\(2\)factors in clawfree graphs
Discuss. Math. Graph Theory, 20 (2000), no. 2, 165172
with J. Faudree, R. Gould, and A. Saito
1999
On harmonious and related colorings of graphs
Paul Erdős and his mathematics (Budapest, 1999), 5053,
János Bolyai Math. Soc., Budapest, 1999
with G. Domke, J. Hattngh, R. Laskar
On the upper linedistinguishing and upper harmonious chromatic numbers of a graph
Papers in honour of Stephen T. Hedetniemi, J. Combin. Math. Combin. Comput., 31 (1999), 227239
with G. Domke, J. Hattingh, and R. Laskar
1998
Tough enough chordal graphs are hamiltonian
Networks, 31 (1998), no. 1, 2938
with M. Jacobson, A. Kézdy, and J. Lehel
Intersection of longest cycles in \(k\)connected graphs
J. Combin. Theory Ser. B, 72 (1998), no. 1, 143149.
with R. Gould and R. Faudree
Note on graphs without repeated cycle lengths
J. Graph Theory, 29 (1998), no. 1, 1115
with M. Jacobson, J. Lehel, and W. Shreve
Vertex colorings with a distance restriction
Graph Theory (Elgersburg, 1996), Discrete Math, 191 (1998), 6582
with A. Gyárfárs and R. Schelp
1997
Graphs with given odd sets
J. Graph Theory, 24 (1997), no. 1, 6980.
with R.H. Schelp, and L. Soltés
Special monochromatic trees in twocolored complete graphs
J. Graph Theory, 24 (1997), no. 1, 5967
with R. Schelp, and L. Soltés
Degree conditions for \(2\)factors
J. Graph Theory, 24 (1997), no. 2, 165173
with S. Brandt, R. Faudree, R. Gould, and L. Lesniak
A new game chromatical numbers
European J. Combin., 18 (1997), no. 1, 19,
with R. Schelp and W. Shreve
A class of edge critical \(4\)chromatic graphs
Graphs Combin., (1997) 13, no. 2, 139146
with A. Gyárfárs and R. Schelp
A special \(k\)coloring for a connected \(k\)chromatic graph
Discrete math, 170 (1997), no. 13, 231236
with R. Schelp and W. Shreve
Can One Load a Set of Dice So That the Sum Is Uniformly Distributed?
Math. Mag., 70 (1997), no. 3, 204 206
with M. Rao and W. Shreve
1996
Proof of a conjecture of Bollobás on nested cycles
J. Combin. Theory Ser. B, 66 (1996), no. 1, 3843
with P. Erdős and W. Staton
A partition approach to Vizing's conjecture
J. Graph Theory, 21 (1996), no. 1, 103111
with W. Piotrawski and W. Shreve
Essential independent sets and hamiltonian cycles
J. Graph Theory, 21 (1996), no. 2, 243250
with Y. Egawa, X. Liu, and A. Saito
1995
The irredundant Ramsey number \(s(3,7)\)
J. Graph Theory, 19 (1995), no. 2, 263270
with C. Rousseau
Clique partitions of split graphs
Combinatorics, graph theory, algorithms and applications (Beijing, 1993), 2130, World Sci. Publ., River Edge, NJ, 1994
with P. Erdős and Ordman
Hamiltonicity for \(K_{1,r}\)free graphs
J. Graph Theory, 20 (1995), no. 4, 423439
with R. Schelp
Hamiltonicity in balanced \(k\)partite graphs
Graphs Combin., 11(1995), 221231
with F. Faudree, R. Gould, M. Jacobson, and L. Lesniak
1994
Hamiltonian graphs with neighborhood intersections
J. Graph Theory, 18 (1994), no. 5, 497513.
with R. Schelp
Neighborhood unions and the cycle cover number of agraph
J. Graph Theory 18 (1994), no. 7, 663672.
with R. Gould, M. Jacobson, and R. Schelp
1993
A generalization of Fan's Condition for hamiltonicity, pancyclicity, and Hamiltonian connectedness
Discrete Math, 115 (1993), no. 13, 3950
with P. Bedrossian and R. Schelp
Ramsey problems involving degrees in edgecolored
complete graphs of vertices belonging to monochromatic subgraphs
European J. Combin., 14 (1993), no. 3, 183189.
with P. Erdős, C. Rousseau, and R. Schelp
1992
A characterization of influence graphs of a prescribed graph
Vishwa Internat. J. Graph Theory, 1 (1992), no. 1, 7781.
with R. Gould, M. Jacobson, R. Schelp, and D. West
1991
A degree condition for hamiltonian cycles in ttough graphs with \(t >1\)
Advances in Graph Theory, 1932, Vishwa, Gulbarga, 1991
with D. Bauer and L. Lasser
1990
