| Graphs with linearly bounded Ramsey numbers GT Chen, RH Schelp Journal of Combinatorial Theory, Series B 57 (1), 138-149, 1993 | 110 | 1993 |
| Degree conditions for 2‐factors S Brandt, G Chen, R Faudree, RJ Gould, L Lesniak Journal of graph Theory 24 (2), 165-173, 1997 | 106 | 1997 |
| Predicting calcium‐binding sites in proteins—A graph theory and geometry approach H Deng, G Chen, W Yang, JJ Yang Proteins: Structure, Function, and Bioinformatics 64 (1), 34-42, 2006 | 103 | 2006 |
| Transforming complete coverage algorithms to partial coverage algorithms for wireless sensor networks Y Li, C Vu, C Ai, G Chen, Y Zhao IEEE Transactions on Parallel and Distributed Systems 22 (4), 695-703, 2010 | 90 | 2010 |
| An interlacing result on normalized Laplacians G Chen, G Davis, F Hall, Z Li, K Patel, M Stewart SIAM Journal on Discrete Mathematics 18 (2), 353-361, 2004 | 86 | 2004 |
| Towards predicting Ca2+‐binding sites with different coordination numbers in proteins with atomic resolution X Wang, M Kirberger, F Qiu, G Chen, JJ Yang Proteins: Structure, Function, and Bioinformatics 75 (4), 787-798, 2009 | 83 | 2009 |
| Statistical analysis of structural characteristics of protein Ca2+-binding sites M Kirberger, X Wang, H Deng, W Yang, G Chen, JJ Yang JBIC Journal of Biological Inorganic Chemistry 13, 1169-1181, 2008 | 73 | 2008 |
| Long cycles in 3-connected graphs G Chen, X Yu Journal of Combinatorial Theory, Series B 86 (1), 80-99, 2002 | 70 | 2002 |
| Extremal graphs for intersecting cliques G Chen, RJ Gould, F Pfender, B Wei Journal of Combinatorial Theory, Series B 89 (2), 159-171, 2003 | 61 | 2003 |
| Tough enough chordal graphs are hamiltonian G Chen, MS Jacobson, AE Kézdy, J Lehel Networks: An International Journal 31 (1), 29-38, 1998 | 51 | 1998 |
| Gauss-Bonnet formula, finiteness condition, and characterizations of graphs embedded in surfaces B Chen, G Chen Graphs and Combinatorics 24 (3), 159-183, 2008 | 45 | 2008 |
| Graph connectivity after path removal G Chen*, RJ Gould, X Yu Combinatorica 23, 185-203, 2003 | 44 | 2003 |
| Graph edge coloring: a survey Y Cao, G Chen, G Jing, M Stiebitz, B Toft Graphs and Combinatorics 35, 33-66, 2019 | 41 | 2019 |
| Second neighborhood via first neighborhood in digraphs G Chen, J Shen, R Yuster Annals of combinatorics 7 (1), 15-20, 2003 | 40 | 2003 |
| Graphs with a cycle of length divisible by three GT Chen, A Saito Journal of Combinatorial Theory, Series B 60 (2), 277-292, 1994 | 39 | 1994 |
| Saturation numbers of books G Chen, RJ Faudree, RJ Gould the electronic journal of combinatorics, R118-R118, 2008 | 37 | 2008 |
| Nonempty intersection of longest paths in series–parallel graphs G Chen, J Ehrenmüller, CG Fernandes, CG Heise, S Shan, P Yang, ... Discrete Mathematics 340 (3), 287-304, 2017 | 36 | 2017 |
| Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs G Chen, G Jing, W Zang arXiv preprint arXiv:1901.10316, 2019 | 30 | 2019 |
| Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs P Erdös, G Chen, CC Rousseau, RH Schelp European Journal of Combinatorics 14 (3), 183-189, 1993 | 30 | 1993 |
| Approximating the chromatic index of multigraphs G Chen, X Yu, W Zang Journal of Combinatorial Optimization 21 (2), 219-246, 2011 | 28 | 2011 |
