default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuantao Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j139]Guantao Chen, Zhiquan Hu, Yaping Wu:
A Chvátal-Erdős type theorem for path-connectivity. Discuss. Math. Graph Theory 44(4): 1247-1260 (2024)- [j138]Yan Cao, Guantao Chen, Guangming Jing, Xuli Qi, Songling Shan:
Precoloring extension of Vizing's Theorem for multigraphs. Eur. J. Comb. 122: 104037 (2024) - [j137]Yan Cao
, Guantao Chen, Guangming Jing, Songling Shan:
The core conjecture of Hilton and Zhao. J. Comb. Theory B 166: 154-182 (2024) - [j136]Guantao Chen, Yanli Hao, Guoning Yu:
A decomposition method on solving the linear arboricity conjecture. J. Graph Theory 105(2): 315-332 (2024) - [j135]Stijn Cambie, Guantao Chen, Yanli Hao, Nizamettin Tokar:
Decreasing the mean subtree order by adding k edges. J. Graph Theory 105(3): 357-366 (2024) - 2023
- [j134]Guantao Chen, Yuan Chen, Zhiquan Hu, Shunzhe Zhang:
Spanning trees with at most k leaves in 2-connected K1,r-free graphs. Appl. Math. Comput. 445: 127842 (2023) - [j133]Xiaodong Chen, Guantao Chen:
Local Dirac's condition on the existence of 2-factor. Discret. Math. 346(7): 113436 (2023) - [j132]Guantao Chen, Nizamettin Tokar:
Unions of perfect matchings in r-graphs. Discret. Math. 346(10): 113550 (2023) - [j131]Guantao Chen, Yanli Hao:
On the coequal values of total chromatic number and chromatic index. J. Comb. Theory B 158(Part): 286-304 (2023) - [j130]Yan Cao, Guantao Chen, Xuli Qi:
Double Vizing fans in critical class two graphs. J. Graph Theory 103(1): 48-65 (2023) - [j129]Guantao Chen, Yanli Hao, Guoning Yu:
Linear arboricity of degenerate graphs. J. Graph Theory 104(2): 360-371 (2023) - [j128]Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang:
On Gupta's Codensity Conjecture. SIAM J. Discret. Math. 37(3): 1666-1673 (2023) - 2022
- [j127]Yan Cao, Guantao Chen, Songling Shan:
An improvement to the Hilton-Zhao vertex-splitting conjecture. Discret. Math. 345(8): 112902 (2022) - [j126]Yan Cao, Guantao Chen, Songling Shan:
Overfullness of critical class 2 graphs with a small core degree. J. Comb. Theory B 156: 145-173 (2022) - [j125]Yan Cao, Guantao Chen, Guangming Jing:
A note on Goldberg's conjecture on total chromatic numbers. J. Graph Theory 100(1): 182-188 (2022) - [j124]Guantao Chen, Yanli Hao:
Multithreshold multipartite graphs. J. Graph Theory 100(4): 727-732 (2022) - [j123]Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
Independence number of edge-chromatic critical graphs. J. Graph Theory 101(2): 288-310 (2022) - [j122]Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree. SIAM J. Discret. Math. 36(3): 2258-2270 (2022) - 2021
- [j121]Guantao Chen, Yanli Hao:
The conjunction of the linear arboricity conjecture and Lovász's path partition theorem. Discret. Math. 344(8): 112434 (2021) - [j120]Guantao Chen, Xiaowei Yu, Yi Zhao:
Improved bounds on the Ramsey number of fans. Eur. J. Comb. 96: 103347 (2021) - [j119]Yan Cao, Guantao Chen:
On the average degree of edge chromatic critical graphs. J. Comb. Theory B 147: 299-338 (2021) - [j118]Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang:
Laminar tight cuts in matching covered graphs. J. Comb. Theory B 150: 177-194 (2021) - [j117]Guantao Chen, Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu:
The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs. J. Graph Theory 96(4): 554-577 (2021) - [j116]Guantao Chen, Yanli Hao:
Multiplicity of the second-largest eigenvalue of a planar graph. J. Graph Theory 98(3): 445-459 (2021) - 2020
- [j115]Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning bipartite graphs with high degree sum in graphs. Discret. Math. 343(2): 111663 (2020) - [j114]Yan Cao, Guantao Chen, Suyun Jiang, Huiqing Liu, Fuliang Lu:
Hamiltonicity of edge-chromatic critical graphs. Discret. Math. 343(7): 111881 (2020) - [j113]Guantao Chen, Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu:
The Chromatic Number of Graphs with No Induced Subdivision of K4. Graphs Comb. 36(3): 719-728 (2020) - [j112]Yan Cao, Guantao Chen:
On the average degree of edge chromatic critical graphs II. J. Comb. Theory B 145: 470-486 (2020) - [j111]Yan Cao, Guantao Chen, Shushan He, Guangming Jing:
Ring graphs and Goldberg's bound on chromatic index. J. Graph Theory 93(3): 440-449 (2020)
2010 – 2019
- 2019
- [j110]Yan Cao, Guantao Chen, Suyun Jiang, Huiqing Liu, Fuliang Lu:
Average degrees of edge-chromatic critical graphs. Discret. Math. 342(6): 1613-1623 (2019) - [j109]Yan Cao, Guantao Chen, Guangming Jing, Michael Stiebitz, Bjarne Toft:
Graph Edge Coloring: A Survey. Graphs Comb. 35(1): 33-66 (2019) - [j108]Guantao Chen, Michitaka Furuya, Songling Shan, Shoichi Tsuchiya, Ping Yang:
Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw. Graphs Comb. 35(6): 1459-1474 (2019) - [j107]Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li:
Extremal Union-Closed Set Families. Graphs Comb. 35(6): 1495-1502 (2019) - [j106]Guantao Chen, Guangming Jing:
Structural properties of edge-chromatic critical multigraphs. J. Comb. Theory B 139: 128-162 (2019) - [j105]Guantao Chen, Xing Feng, Fuliang Lu, Lianzhu Zhang:
Disjoint Odd Cycles in Cubic Solid Bricks. SIAM J. Discret. Math. 33(1): 393-397 (2019) - [j104]Guantao Chen, Songling Shan:
Dirac's Condition for Spanning Halin Subgraphs. SIAM J. Discret. Math. 33(4): 1997-2022 (2019) - 2018
- [j103]Guantao Chen, Ronald J. Gould, Xiaofeng Gu, Akira Saito:
Cycles with a chord in dense graphs. Discret. Math. 341(8): 2131-2141 (2018) - [j102]Guantao Chen, Yuping Gao, Ringi Kim, Luke Postle, Songling Shan:
Chromatic index determined by fractional chromatic index. J. Comb. Theory B 131: 85-108 (2018) - 2017
- [j101]Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise, Songling Shan, Ping Yang, Amy N. Yates:
Nonempty intersection of longest paths in series-parallel graphs. Discret. Math. 340(3): 287-304 (2017) - [j100]Guantao Chen, Xiaodong Chen, Yue Zhao:
Hamiltonicity of edge chromatic critical graphs. Discret. Math. 340(12): 3011-3015 (2017) - [j99]Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan:
Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs. Graphs Comb. 33(5): 1095-1101 (2017) - [j98]Guantao Chen, Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya:
Forbidden Pairs and the Existence of a Spanning Halin Subgraph. Graphs Comb. 33(5): 1321-1345 (2017) - [j97]Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu:
Equitable vertex arboricity of 5-degenerate graphs. J. Comb. Optim. 34(2): 426-432 (2017) - [j96]Guantao Chen, Songling Shan:
Vizing's 2-Factor Conjecture Involving Large Maximum Degree. J. Graph Theory 86(4): 422-438 (2017) - [j95]Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. 31(4): 2429-2439 (2017) - 2016
- [j94]Xuan Guo, Bing Liu, Le Chen, Guantao Chen, Yi Pan, Jing Zhang:
Bayesian Inference for Functional Dynamics Exploring in fMRI Data. Comput. Math. Methods Medicine 2016: 3279050:1-3279050:9 (2016) - 2015
- [j93]Guantao Chen, Yinkui Li, Haicheng Ma, Tingzeng Wu, Liming Xiong:
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets. Graphs Comb. 31(4): 885-896 (2015) - [j92]Guantao Chen, Songling Shan:
Characterizing Forbidden Pairs for Hamiltonian Squares. Graphs Comb. 31(6): 2113-2124 (2015) - [j91]Guantao Chen, Katsuhiro Ota:
Hadwiger's conjecture for degree sequences. J. Comb. Theory B 114: 247-249 (2015) - [j90]Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan:
Disjoint Chorded Cycles of the Same Length. SIAM J. Discret. Math. 29(2): 1030-1041 (2015) - [j89]Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. SIAM J. Discret. Math. 29(3): 1423-1426 (2015) - [c5]Zhichao Lian, Xiang Li, Yi Pan, Xuan Guo, Le Chen, Guantao Chen, Zhihui Wei, Tianming Liu, Jing Zhang:
Dynamic Bayesian brain network partition and connectivity change point detection. ICCABS 2015: 1-6 - 2014
- [j88]Guantao Chen, Manzhan Gu, Nana Li:
On Maximum Edge Cuts of Connected Digraphs. J. Graph Theory 76(1): 1-19 (2014) - [j87]Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu:
Degree Conditions for Spanning Brooms. J. Graph Theory 77(3): 237-250 (2014) - 2013
- [j86]Guantao Chen, Songling Shan:
Homeomorphically irreducible spanning trees. J. Comb. Theory B 103(4): 409-414 (2013) - [j85]Guantao Chen, Akira Saito, Songling Shan:
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition. SIAM J. Discret. Math. 27(4): 1788-1799 (2013) - 2012
- [j84]Guantao Chen, Han Ren, Songling Shan:
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs. Comb. Probab. Comput. 21(1-2): 107-111 (2012) - [j83]Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito:
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discret. Math. 312(5): 938-942 (2012) - [j82]Guantao Chen, Katsuhiro Ota, Akira Saito, Yi Zhao:
Hamiltonian cycles with all small even chords. Discret. Math. 312(6): 1226-1240 (2012) - [j81]Guantao Chen, Zhiquan Hu, Hao Li:
Endpoint extendable paths in dense graphs. Discret. Math. 312(17): 2584-2592 (2012) - [j80]Guantao Chen, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor, II. J. Comb. Theory B 102(6): 1211-1240 (2012) - 2011
- [j79]Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota:
Toughness of Ka,t-Minor-Free Graphs. Electron. J. Comb. 18(1) (2011) - [j78]Guantao Chen, Xingxing Yu, Wenan Zang:
Approximating the chromatic index of multigraphs. J. Comb. Optim. 21(2): 219-246 (2011) - [j77]Guantao Chen, Zhiquan Hu, Yaping Wu:
Circumferences of k-connected graphs involving independence numbers. J. Graph Theory 68(1): 55-76 (2011) - [j76]Yingshu Li, Chinh T. Vu, Chunyu Ai, Guantao Chen, Yi Zhao:
Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks. IEEE Trans. Parallel Distributed Syst. 22(4): 695-703 (2011) - 2010
- [j75]Guantao Chen, Ralph J. Faudree, Lubomír Soltés:
Path spectra for trees. Discret. Math. 310(24): 3455-3461 (2010) - [j74]Kun Zhao, Guantao Chen, Thomas Gift, Guoyu Tao:
Optimization Model and Algorithm Help to Screen and Treat Sexually Transmitted Diseases. Int. J. Comput. Model. Algorithms Medicine 1(4): 1-18 (2010) - [j73]Arthur H. Busch, Guantao Chen, Michael S. Jacobson:
Transitive partitions in realizations of tournament score sequences. J. Graph Theory 64(1): 52-62 (2010) - [c4]Xue Wang, Fasheng Qiu, Sushil K. Prasad, Guantao Chen:
Efficient parallel algorithms for maximum-density segment problem. IPDPS 2010: 1-9
2000 – 2009
- 2009
- [j72]Guantao Chen, Xingxing Yu, Wenan Zang:
Preface. Discret. Math. 309(5): 1019 (2009) - [j71]Joseph Brennan, Guantao Chen:
Toric Geometry of Series-Parallel Graphs. SIAM J. Discret. Math. 23(2): 754-764 (2009) - [c3]Chinh T. Vu, Guantao Chen, Yi Zhao, Yingshu Li:
A universal framework for partial coverage in Wireless Sensor Networks. IPCCC 2009: 1-8 - 2008
- [j70]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers of Books. Electron. J. Comb. 15(1) (2008) - [j69]Guantao Chen, Michael Ferrara, Ronald J. Gould, John R. Schmitt:
Graphic sequences with a realization containing a complete multipartite subgraph. Discret. Math. 308(23): 5712-5721 (2008) - [j68]Beifang Chen, Guantao Chen:
Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces. Graphs Comb. 24(3): 159-183 (2008) - [j67]Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu:
Linked graphs with restricted lengths. J. Comb. Theory B 98(4): 735-751 (2008) - [j66]Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer:
Non-path spectrum sets. J. Graph Theory 58(4): 329-350 (2008) - 2007
- [j65]Guantao Chen, Richard H. Schelp:
Decomposition of bipartite graphs into special subgraphs. Discret. Appl. Math. 155(3): 400-404 (2007) - [j64]Guantao Chen, Xuechao Li, Zhengsheng Wu, Xingping Xu:
The neighborhood union of independent sets and hamiltonicity of graphs. Discret. Math. 307(17-18): 2226-2234 (2007) - [j63]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - 2006
- [j62]Guantao Chen, Joan P. Hutchinson, Ken Keating, Jian Shen:
Characterization of [1, k]-Bar Visibility Trees. Electron. J. Comb. 13(1) (2006) - [j61]Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor. J. Comb. Theory B 96(6): 822-845 (2006) - [j60]Guantao Chen, Warren E. Shreve, Bing Wei:
Hamiltonian graphs involving neighborhood unions. J. Graph Theory 53(2): 83-100 (2006) - [j59]Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating Longest Cycles in Graphs with Bounded Degrees. SIAM J. Comput. 36(3): 635-656 (2006) - [j58]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discret. Math. 20(3): 682-689 (2006) - [c2]Guantao Chen, Hai Deng, Yufeng Gui, Yi Pan, Xue Wang:
Cysteine separations profiles on protein secondary structure infer disulfide connectivity. GrC 2006: 663-665 - 2005
- [j57]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - [c1]Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. COCOON 2005: 870-884 - 2004
- [j56]Guantao Chen, Ronald J. Gould, Florian Pfender:
New Conditions for k-ordered Hamiltonian Graphs. Ars Comb. 70 (2004) - [j55]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender:
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24(3): 359-372 (2004) - [j54]Guantao Chen, Genghua Fan, Xingxing Yu:
Cycles in 4-connected planar graphs. Eur. J. Comb. 25(6): 763-780 (2004) - [j53]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46(3): 145-166 (2004) - [j52]Guantao Chen, Jun Xu, Xingxing Yu:
Circumference of Graphs with Bounded Degree. SIAM J. Comput. 33(5): 1136-1170 (2004) - [j51]Guantao Chen, George Davis, Frank J. Hall, Zhongshan Li, Kinnari Patel, Michael Stewart:
An Interlacing Result on Normalized Laplacians. SIAM J. Discret. Math. 18(2): 353-361 (2004) - 2003
- [j50]Guantao Chen, Ronald J. Gould, Xingxing Yu:
Graph Connectivity After Path Removal. Comb. 23(2): 185-203 (2003) - [j49]Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei:
On Ranks of Matrices Associated with Trees. Graphs Comb. 19(3): 323-334 (2003) - [j48]Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei:
Extremal graphs for intersecting cliques. J. Comb. Theory B 89(2): 159-171 (2003) - 2002
- [j47]Guantao Chen, Xingxing Yu:
A note on fragile graphs. Discret. Math. 249(1-3): 41-43 (2002) - [j46]Guantao Chen, Akira Saito, Bing Wei, Xuerong Zhang:
The hamiltonicity of bipartite graphs involving neighborhood unions. Discret. Math. 249(1-3): 45-56 (2002) - [j45]Guantao Chen, Xingxing Yu:
Long Cycles in 3-Connected Graphs. J. Comb. Theory B 86(1): 80-99 (2002) - [j44]Guantao Chen, Ralph J. Faudree, Michael S. Jacobson:
Fragile graphs with small independent cuts. J. Graph Theory 41(4): 327-341 (2002) - 2001
- [j43]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23: 37-48 (2001) - [j42]Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Weak Clique-Covering Cycles and Paths. Ars Comb. 58 (2001) - [j41]Guantao Chen, Joan P. Hutchinson, Wiktor Piotrowski, Warren E. Shreve, Bing Wei:
Degree Sequences with Repeated Values. Ars Comb. 59 (2001) - [j40]Guantao Chen, Bing Wei, Xuerong Zhang:
Degree-Light-Free Graphs and Hamiltonian Cycles. Graphs Comb. 17(3): 409-434 (2001) - [j39]Guantao Chen, Ronald J. Gould, Hao Li:
Partitioning Vertices of a Tournament into Independent Cycles. J. Comb. Theory B 83(2): 213-220 (2001) - 2000
- [j38]Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang:
Clique covering the edges of a locally cobipartite graph. Discret. Math. 219(1-3): 17-26 (2000) - [j37]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito:
2-factors in claw-free graphs. Discuss. Math. Graph Theory 20(2): 165-172 (2000) - [j36]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs Comb. 16(1): 67-80 (2000)
1990 – 1999
- 1999
- [j35]Guantao Chen, Ronald J. Gould, Michael S. Jacobson:
On 2-factors containing 1-factors in bipartite graphs. Discret. Math. 197-198: 185-194 (1999) - 1998
- [j34]Nirmala Achuthan, Guantao Chen:
Mixed Ramsey numbers: total chromatic number versus stars. Australas. J Comb. 17: 157-168 (1998) - [j33]Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Note on Whitney's Theorem for k-connected Graphs. Ars Comb. 49 (1998) - [j32]Guantao Chen, András Gyárfás, Richard H. Schelp:
Vertex colorings with a distance restriction. Discret. Math. 191(1-3): 65-82 (1998) - [j31]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Intersections of Longest Cycles in k-Connected Graphs. J. Comb. Theory B 72(1): 143-149 (1998) - [j30]Guantao Chen, Xiaoyun Lu, Douglas B. West:
Star-factors of tournaments. J. Graph Theory 28(3): 141-145 (1998) - [j29]Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve:
Note on graphs without repeated cycle lengths. J. Graph Theory 29(1): 11-15 (1998) - [j28]Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998) - 1997
- [j27]Guantao Chen, Yiping Liu:
Hamiltonian Graphs with Large Neighborhood Unions. Ars Comb. 46 (1997) - [j26]Guantao Chen:
A result on C4-star Ramsey numbers. Discret. Math. 163(1-3): 243-246 (1997) - [j25]Guantao Chen, Richard H. Schelp, Warren E. Shreve:
A special k-coloring for a connected k-chromatic graph. Discret. Math. 170(1-3): 231-236 (1997) - [j24]Guantao Chen, Richard H. Schelp, Warren E. Shreve:
A New Game Chromatic Number. Eur. J. Comb. 18(1): 1-9 (1997) - [j23]Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp:
A Class of Edge Critical 4-Chromatic Graphs. Graphs Comb. 13(2): 139-146 (1997) - [j22]Guantao Chen, Michael S. Jacobson:
Degree Sum Conditions for Hamiltonicity on k-Partite Graphs. Graphs Comb. 13(4): 325-343 (1997) - [j21]Guantao Chen, Richard H. Schelp, Lubomír Soltés:
Special monochromatic trees in two-colored complete graphs. J. Graph Theory 24(1): 59-67 (1997) - [j20]Guantao Chen, Richard H. Schelp, Lubomír Soltés:
Graphs with given odd sets. J. Graph Theory 24(1): 69-80 (1997) - [j19]Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - 1996
- [j18]Guantao Chen, Paul Erdös, William Staton:
Proof of a Conjecture of Bollob's on Nested Cycles. J. Comb. Theory B 66(1): 38-43 (1996) - [j17]Guantao Chen, Wiktor Piotrowski, Warren E. Shreve:
A partition approach to Vizing's conjecture. J. Graph Theory 21(1): 103-111 (1996) - [j16]Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito:
Essential independent sets and Hamiltonian cycles. J. Graph Theory 21(2): 243-249 (1996) - 1995
- [j15]Guantao Chen, Lisa R. Marcus, Richard H. Schelp:
Vertex disjoint cycles for star free graphs. Australas. J Comb. 11: 157-168 (1995) - [j14]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - [j13]Guantao Chen, Cecil C. Rousseau:
The irredundant ramsey number s(3, 7). J. Graph Theory 19(2): 263-270 (1995) - [j12]Guantao Chen, Richard H. Schelp:
Hamiltonicity for K1, r-free graphs. J. Graph Theory 20(4): 423-439 (1995) - 1994
- [j11]Guantao Chen, Akira Saito:
Graphs with a Cycle of Length Divisible by Three. J. Comb. Theory B 60(2): 277-292 (1994) - [j10]Guantao Chen, Richard H. Schelp:
Hamiltonian graphs with neighborhood intersections. J. Graph Theory 18(5): 497-513 (1994) - [j9]Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and the cycle cover number of a graph. J. Graph Theory 18(7): 663-672 (1994) - 1993
- [j8]Guantao Chen, Richard H. Schelp:
Ramsey Problems With Bounded Degree Spread. Comb. Probab. Comput. 2: 263-269 (1993) - [j7]Guantao Chen:
Hamiltonian graphs involving neighborhood intersections. Discret. Math. 112(1-3): 253-257 (1993) - [j6]P. Bedrossian, Guantao Chen, Richard H. Schelp:
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness. Discret. Math. 115(1-3): 39-50 (1993) - [j5]Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp:
Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. Eur. J. Comb. 14(3): 183-189 (1993) - [j4]Guantao Chen, Richard H. Schelp:
Graphs with Linearly Bounded Ramsey Numbers. J. Comb. Theory B 57(1): 138-149 (1993) - [j3]Guantao Chen, Johannes H. Hattingh, Cecil C. Rousseau:
Asymptotic bounds for irredundant and mixed Ramsey numbers. J. Graph Theory 17(2): 193-206 (1993) - 1992
- [j2]Guantao Chen, Richard H. Schelp:
Hamiltonian graphs involving distances. J. Graph Theory 16(2): 121-129 (1992) - 1990
- [j1]Guantao Chen:
One sufficient condition for hamiltonian graphs. J. Graph Theory 14(4): 501-508 (1990)
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-09-02 20:26 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:
