Year |
Citation |
Score |
2020 |
Cao Y, Chen G. On the average degree of edge chromatic critical graphs II Journal of Combinatorial Theory, Series B. 145: 470-486. DOI: 10.1016/J.Jctb.2020.07.007 |
0.569 |
|
2020 |
Chen G, Chiba S, Gould RJ, Gu X, Saito A, Tsugaki M, Yamashita T. Spanning bipartite graphs with high degree sum in graphs Discrete Mathematics. 343: 111663. DOI: 10.1016/J.Disc.2019.111663 |
0.501 |
|
2020 |
Chen G, Chen Y, Cui Q, Feng X, Liu Q. The Chromatic Number of Graphs with No Induced Subdivision of K 4 . Graphs and Combinatorics. 36: 719-728. DOI: 10.1007/S00373-020-02148-X |
0.547 |
|
2020 |
Cao Y, Chen G, He S, Jing G. Ring graphs and Goldberg's bound on chromatic index Journal of Graph Theory. 93: 440-449. DOI: 10.1002/Jgt.22494 |
0.481 |
|
2019 |
Chen G, Feng X, Lu F, Zhang L. Disjoint Odd Cycles in Cubic Solid Bricks Siam Journal On Discrete Mathematics. 33: 393-397. DOI: 10.1137/18M1185296 |
0.37 |
|
2019 |
Chen G, Shan S. Dirac's Condition for Spanning Halin Subgraphs Siam Journal On Discrete Mathematics. 33: 1997-2022. DOI: 10.1137/17M1138960 |
0.517 |
|
2019 |
Chen G, Jing G. Structural properties of edge-chromatic critical multigraphs Journal of Combinatorial Theory, Series B. 139: 128-162. DOI: 10.1016/J.Jctb.2019.03.004 |
0.495 |
|
2019 |
Cao Y, Chen G, Jiang S, Liu H, Lu F. Average degrees of edge-chromatic critical graphs Discrete Mathematics. 342: 1613-1623. DOI: 10.1016/J.Disc.2019.02.014 |
0.492 |
|
2019 |
Chen G, Furuya M, Shan S, Tsuchiya S, Yang P. Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw Graphs and Combinatorics. 35: 1459-1474. DOI: 10.1007/S00373-019-02108-0 |
0.505 |
|
2019 |
Cao Y, Chen G, Jing G, Stiebitz M, Toft B. Graph Edge Coloring: A Survey Graphs and Combinatorics. 35: 33-66. DOI: 10.1007/S00373-018-1986-5 |
0.458 |
|
2018 |
Chen G, Gao Y, Kim R, Postle L, Shan S. Chromatic index determined by fractional chromatic index Journal of Combinatorial Theory, Series B. 131: 85-108. DOI: 10.1016/J.Jctb.2018.01.006 |
0.448 |
|
2018 |
Chen G, Gould RJ, Gu X, Saito A. Cycles with a chord in dense graphs Discrete Mathematics. 341: 2131-2141. DOI: 10.1016/J.Disc.2018.04.016 |
0.505 |
|
2017 |
Chen G, Enomoto H, Ozeki K, Tsuchiya S. Plane Triangulations Without a Spanning Halin Subgraph II Siam Journal On Discrete Mathematics. 31: 2429-2439. DOI: 10.1137/16M1072693 |
0.533 |
|
2017 |
Cao Y, Chen G, Jiang S, Liu H, Lu F. Hamiltonicity of edge chromatic critical graphs Discrete Mathematics. 340: 3011-3015. DOI: 10.1016/J.Disc.2017.07.013 |
0.541 |
|
2017 |
Chen G, Ehrenmüller J, Fernandes CG, Heise CG, Shan S, Yang P, Yates AN. Nonempty intersection of longest paths in series-parallel graphs Discrete Mathematics. 340: 287-304. DOI: 10.1016/J.Disc.2016.07.023 |
0.55 |
|
2017 |
Chen G, Han J, O S, Shan S, Tsuchiya S. Forbidden Pairs and the Existence of a Spanning Halin Subgraph Graphs and Combinatorics. 33: 1321-1345. DOI: 10.1007/S00373-017-1847-7 |
0.554 |
|
2017 |
Chen G, Ellingham MN, Saito A, Shan S. Spanning Trails with Maximum Degree at Most 4 in $$2K_2$$-Free Graphs Graphs and Combinatorics. 33: 1095-1101. DOI: 10.1007/S00373-017-1823-2 |
0.551 |
|
2017 |
Chen G, Shan S. Vizing's 2‐Factor Conjecture Involving Large Maximum Degree Journal of Graph Theory. 86: 422-438. DOI: 10.1002/Jgt.22135 |
0.513 |
|
2016 |
Chen G, Gao Y, Shan S, Wang G, Wu J. Equitable vertex arboricity of 5-degenerate graphs Journal of Combinatorial Optimization. 1-7. DOI: 10.1007/S10878-016-9997-8 |
0.537 |
|
2015 |
Chen G, Enomoto H, Ozeki K, Tsuchiya S. Plane triangulations without a spanning halin subgraph: Counterexamples to the lovászâ€"plummer conjecture on halin graphs Siam Journal On Discrete Mathematics. 29: 1423-1426. DOI: 10.1137/140971610 |
0.53 |
|
2015 |
Chen G, Gould RJ, Hirohata K, Ota K, Shan S. Disjoint chorded cycles of the same length Siam Journal On Discrete Mathematics. 29: 1030-1041. DOI: 10.1137/130929837 |
0.484 |
|
2015 |
Chen G, Ota K. Hadwiger's conjecture for degree sequences Journal of Combinatorial Theory. Series B. 114: 247-249. DOI: 10.1016/J.Jctb.2015.03.006 |
0.571 |
|
2015 |
Chen G, Shan S. Characterizing Forbidden Pairs for Hamiltonian Squares Graphs and Combinatorics. DOI: 10.1007/S00373-015-1524-7 |
0.574 |
|
2015 |
Chen G, Li Y, Ma H, Wu T, Xiong L. An Extension of the Chvátal---Erdős Theorem: Counting the Number of Maximum Independent Sets Graphs and Combinatorics. 31: 885-896. DOI: 10.1007/S00373-014-1416-2 |
0.492 |
|
2014 |
Chen Y, Chen G, Hu Z. Spanning 3-ended trees in k-connected K 1,4-free graphs Science China-Mathematics. 57: 1579-1586. DOI: 10.1007/S11425-014-4817-Z |
0.528 |
|
2014 |
Chen G, Ferrara M, Hu Z, Jacobson M, Liu H. Degree conditions for spanning brooms Journal of Graph Theory. 77: 237-250. DOI: 10.1002/Jgt.21784 |
0.513 |
|
2014 |
Chen G, Gu M, Li N. On Maximum Edge Cuts of Connected Digraphs Journal of Graph Theory. 76: 1-19. DOI: 10.1002/Jgt.21746 |
0.308 |
|
2013 |
Chen G, Saito A, Shan S. The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition Siam Journal On Discrete Mathematics. 27: 1788-1799. DOI: 10.1137/12090037X |
0.496 |
|
2013 |
Chen G, Shan S. Homeomorphically irreducible spanning trees Journal of Combinatorial Theory, Series B. 103: 409-414. DOI: 10.1016/J.Jctb.2013.04.001 |
0.543 |
|
2012 |
Chen G, Ren H, Shan S. Homeomorphically irreducible spanning trees in locally connected graphs Combinatorics, Probability & Computing. 21: 107-111. DOI: 10.1017/S0963548311000526 |
0.565 |
|
2012 |
Chen G, Ota K, Saito A, Zhao Y. Hamiltonian cycles with all small even chords Discrete Mathematics. 312: 1226-1240. DOI: 10.1016/J.Disc.2011.12.013 |
0.529 |
|
2012 |
Chen G, Egawa Y, Gould RJ, Saito A. Forbidden pairs for k-connected Hamiltonian graphs Discrete Mathematics. 312: 938-942. DOI: 10.1016/J.Disc.2011.10.019 |
0.413 |
|
2012 |
Chen G, Hu Z, Li H. Endpoint extendable paths in dense graphs Discrete Mathematics. 312: 2584-2592. DOI: 10.1016/J.Disc.2011.09.014 |
0.593 |
|
2011 |
Chen G, Ferrara M, Gould RJ, Magnant C, Schmitt J. Saturation numbers for families of Ramsey-minimal graphs The Journal of Combinatorics. 2: 435-455. DOI: 10.4310/Joc.2011.V2.N3.A5 |
0.521 |
|
2011 |
Chen G, Egawa Y, Kawarabayashi Ki, Mohar B, Ota K. Toughness of $K_{a,t}$-Minor-free Graphs Electronic Journal of Combinatorics. 18: 148. DOI: 10.37236/635 |
0.568 |
|
2011 |
Chen G, Yu X, Zang W. Approximating the chromatic index of multigraphs Journal of Combinatorial Optimization. 21: 219-246. DOI: 10.1007/S10878-009-9232-Y |
0.429 |
|
2011 |
Chen G, Hu Z, Wu Y. Circumferences of k -connected graphs involving independence numbers Journal of Graph Theory. 68: 55-76. DOI: 10.1002/Jgt.20540 |
0.529 |
|
2010 |
Chen G, Faudree RJ, Ľolts S. Path spectra for trees Discrete Mathematics. 310: 3455-3461. DOI: 10.1016/J.Disc.2010.08.010 |
0.432 |
|
2009 |
Brennan J, Chen G. Toric Geometry of Series-Parallel Graphs Siam Journal On Discrete Mathematics. 23: 754-764. DOI: 10.1137/070703247 |
0.583 |
|
2008 |
Chen G, Faudree RJ, Gould RJ. Saturation Numbers of Books Electronic Journal of Combinatorics. 15: 118. DOI: 10.37236/842 |
0.361 |
|
2008 |
Chen G, Chen Y, Gao S, Hu Z. Linked graphs with restricted lengths Journal of Combinatorial Theory, Series B. 98: 735-751. DOI: 10.1016/J.Jctb.2007.11.004 |
0.444 |
|
2008 |
Chen G, Ferrara M, Gould RJ, Schmitt JR. Graphic sequences with a realization containing a complete multipartite subgraph Discrete Mathematics. 308: 5712-5721. DOI: 10.1016/J.Disc.2007.10.047 |
0.491 |
|
2008 |
Chen B, Chen G. Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces Graphs and Combinatorics. 24: 159-183. DOI: 10.1007/S00373-008-0782-Z |
0.505 |
|
2008 |
Chen G, Faudree RJ, Li X, Schiermeyer I. Non-path spectrum sets Journal of Graph Theory. 58: 329-350. DOI: 10.1002/Jgt.V58:4 |
0.562 |
|
2007 |
Chen G, Li X, Wu Z, Xu X. The neighborhood union of independent sets and hamiltonicity of graphs Discrete Mathematics. 307: 2226-2234. DOI: 10.1016/J.Disc.2006.10.010 |
0.452 |
|
2007 |
Chen G, Schelp RH. Decomposition of bipartite graphs into special subgraphs Discrete Applied Mathematics. 155: 400-404. DOI: 10.1016/J.Dam.2006.06.011 |
0.404 |
|
2006 |
Chen G, Hutchinson JP, Keating K, Shen J. Characterization of (1; k)-Bar Visibility Trees Electronic Journal of Combinatorics. 13: 90. DOI: 10.37236/1116 |
0.551 |
|
2006 |
Chen G, Faudree RJ, Gould RJ, Jacobson MS. Cycle extendability of Hamiltonian interval graphs Siam Journal On Discrete Mathematics. 20: 682-689. DOI: 10.1137/S0895480104441450 |
0.56 |
|
2006 |
Chen G, Gao Z, Yu X, Zang W. Approximating Longest Cycles in Graphs with Bounded Degrees Siam Journal On Computing. 36: 635-656. DOI: 10.1137/050633263 |
0.505 |
|
2006 |
Chen G, Sheppardson L, Yu X, Zang W. The circumference of a graph with no K3, t-minor Journal of Combinatorial Theory. Series B. 96: 822-845. DOI: 10.1016/J.Jctb.2006.02.006 |
0.495 |
|
2006 |
Chen G, Li X, Wu Z, Xu X. WITHDRAWN: The neighborhood union of independent sets and hamiltonicity of graphs Discrete Mathematics. DOI: 10.1016/J.Disc.2006.10.012 |
0.514 |
|
2006 |
Chen G, Shreve WE, Wei B. Hamiltonian graphs involving neighborhood unions Journal of Graph Theory. 53: 83-100. DOI: 10.1002/Jgt.V53:2 |
0.568 |
|
2005 |
Chen G, Gould RJ, Kawarabayashi K, Pfender F, Wei B. Graph Minors and Linkages Journal of Graph Theory. 49: 75-91. DOI: 10.1002/Jgt.V49:1 |
0.569 |
|
2004 |
Chen G, Faudree RJ, Gould RJ, Jacobson MS, Lesniak LM, Pfender F. Linear forests and ordered cycles Discussiones Mathematicae Graph Theory. 24: 359-372. DOI: 10.7151/Dmgt.1236 |
0.455 |
|
2004 |
Chen G, Davis G, Hall F, Li Z, Patel K, Stewart M. An Interlacing Result on Normalized Laplacians Siam Journal On Discrete Mathematics. 18: 353-361. DOI: 10.1137/S0895480103438589 |
0.547 |
|
2004 |
Chen G, Xu J, Yu X. Circumference of Graphs with Bounded Degree Siam Journal On Computing. 33: 1136-1170. DOI: 10.1137/S0097539703436473 |
0.559 |
|
2004 |
Chen G, Fan G, Yu X. Cycles in 4-connected planar graphs European Journal of Combinatorics. 25: 763-780. DOI: 10.1016/J.Ejc.2003.04.003 |
0.516 |
|
2004 |
Chen G, Enomoto H, Kawarabayashi K, Ota K, Lou D, Saito A. Vertex-disjoint cycles containing specified vertices in a bipartite graph: VERTEX-DISJOINT CYCLES IN BIPARTITE GRAPHS Journal of Graph Theory. 46: 145-166. DOI: 10.1002/Jgt.10159 |
0.544 |
|
2003 |
Chen G, Gould RJ, Pfender F, Wei B. Extremal graphs for intersecting cliques Journal of Combinatorial Theory. Series B. 89: 159-171. DOI: 10.1016/S0095-8956(03)00044-3 |
0.536 |
|
2003 |
Chen G, Hall FJ, Li Z, Wei B. On Ranks of Matrices Associated with Trees Graphs and Combinatorics. 19: 323-334. DOI: 10.1007/S00373-002-0522-8 |
0.411 |
|
2003 |
Chen G, Gould RJ, Yu XX. Graph connectivity after path removal Combinatorica. 23: 185-203. DOI: 10.1007/S003-0018-Z |
0.512 |
|
2003 |
Chen G, Shen J, Yuster R. Second Neighborhood via First Neighborhood in Digraphs Annals of Combinatorics. 7: 15-20. DOI: 10.1007/S000260300001 |
0.344 |
|
2002 |
Chen G, Saito A, Wei B, Zhang X. The Hamiltonicity of bipartite graphs involving neighborhood unions Discrete Mathematics. 249: 45-56. DOI: 10.1016/S0012-365X(01)00227-8 |
0.446 |
|
2002 |
Chen G, Yu X. A note on fragile graphs Discrete Mathematics. 249: 41-43. DOI: 10.1016/S0012-365X(01)00226-6 |
0.579 |
|
2002 |
Chen G, Yu X. Long cycles in 3-connected graphs Journal of Combinatorial Theory, Series B. 86: 80-99. DOI: 10.1006/Jctb.2002.2113 |
0.584 |
|
2001 |
Chen G, Wei B, Zhang X. Degree-Light-Free Graphs and Hamiltonian Cycles Graphs and Combinatorics. 17: 409-434. DOI: 10.1007/S003730170018 |
0.555 |
|
2001 |
Chen G, Gould RJ, Li H. Partitioning verticles of a tournament into independent cycles Journal of Combinatorial Theory. Series B. 83: 213-220. DOI: 10.1006/Jctb.2001.2048 |
0.433 |
|
2000 |
Chen G, Faudree RJ, Gould RJ, Saito A. 2-factors in claw-free graphs Discussiones Mathematicae Graph Theory. 20: 165-172. DOI: 10.7151/Dmgt.1116 |
0.49 |
|
2000 |
Chen G, Jacobson MS, Kézdy AE, Lehel J, Scheinerman ER, Wang C. Clique covering the edges of a locally cobipartite graph Discrete Mathematics. 219: 17-26. DOI: 10.1016/S0012-365X(99)00333-7 |
0.526 |
|
2000 |
Chen G, Faudree RJ, Gould RJ, Jacobson MS, Lesniak LM. Cycles in 2-Factors of Balanced Bipartite Graphs Graphs and Combinatorics. 16: 67-80. DOI: 10.1007/S003730050004 |
0.562 |
|
1999 |
Chen G, Gould RJ, Jacobson MS. On 2-factors containing 1-factors in bipartite graphs Discrete Mathematics. 197: 185-194. DOI: 10.1016/S0012-365X(98)00233-7 |
0.55 |
|
1999 |
Chen G. Further Reflections on Thompson's Conjecture Journal of Algebra. 218: 276-285. |
0.385 |
|
1998 |
Chen G, Gyárfás A, Schelp RH. Vertex coloring with a distance restriction Discrete Mathematics. 191: 65-82. DOI: 10.1016/S0012-365X(98)00094-6 |
0.472 |
|
1998 |
Chen G, Faudree RJ, Gould RJ. Intersections of Longest Cycles in k-Connected Graphs Journal of Combinatorial Theory, Series B. 72: 143-149. DOI: 10.1006/Jctb.1997.1802 |
0.554 |
|
1998 |
Chen G, Lehel J, Jacobson MS, Shreve WE. Note on graphs without repeated cycle lengths Journal of Graph Theory. 29: 11-15. DOI: 10.1002/(Sici)1097-0118(199809)29:1<>1.0.Co;2-U |
0.52 |
|
1998 |
Chen G, Jacobson MS, Kézdy AE, Lehel J. Tough enough chordal graphs are hamiltonian Networks. 31: 29-38. DOI: 10.1002/(Sici)1097-0037(199801)31:1<29::Aid-Net4>3.0.Co;2-M |
0.533 |
|
1997 |
Chen G, Schelp RH, Shreve WE. A special k -coloring for a connected k -chromatic graph Discrete Mathematics. 170: 231-236. DOI: 10.1016/S0012-365X(96)00123-9 |
0.481 |
|
1997 |
Chen G. A result on C 4 -star Ramsey numbers Discrete Mathematics. 163: 243-246. DOI: 10.1016/0012-365X(95)00340-3 |
0.341 |
|
1997 |
Chen G, Jacobson MS. Degree Sum Conditions for Hamiltonicity on k-Partite Graphs Graphs and Combinatorics. 13: 325-343. DOI: 10.1007/Bf03353011 |
0.577 |
|
1997 |
Chen G, Erdős P, Gyárfás A, Schelp RH. A Class of Edge Critical 4-Chromatic Graphs Graphs and Combinatorics. 13: 139-146. DOI: 10.1007/Bf03352991 |
0.592 |
|
1997 |
Chen G, Schelp RH, Shreve WE. A New Game Chromatic Number The Journal of Combinatorics. 18: 1-9. DOI: 10.1006/Eujc.1994.0071 |
0.481 |
|
1997 |
Brandt S, Chen G, Faudree R, Gould RJ, Lesniak L. Degree conditions for 2-factors Journal of Graph Theory. 24: 165-173. DOI: 10.1002/(Sici)1097-0118(199702)24:2<165::Aid-Jgt4>3.0.Co;2-O |
0.533 |
|
1997 |
Chen G, Schelp RH, Lcaron, Šoltés u. Graphs with given odd sets Journal of Graph Theory. 24: 69-80. DOI: 10.1002/(Sici)1097-0118(199701)24:1<69::Aid-Jgt8>3.3.Co;2-9 |
0.512 |
|
1997 |
Chen G, Schelp RH, Lcaron, Šoltés u. Special monochromatic trees in two-colored complete graphs Journal of Graph Theory. 24: 59-67. DOI: 10.1002/(Sici)1097-0118(199701)24:1<59::Aid-Jgt7>3.0.Co;2-I |
0.508 |
|
1996 |
Chen G, Erdós P, Staton W. Proof of a Conjecture of Bollob?s on Nested Cycles Journal of Combinatorial Theory, Series B. 66: 38-43. DOI: 10.1006/Jctb.1996.0005 |
0.38 |
|
1996 |
Chen G, Egawa Y, Liu X, Saito A. Essential independent sets and Hamiltonian cycles Journal of Graph Theory. 21: 243-249. DOI: 10.1002/(Sici)1097-0118(199602)21:2<242::Aid-Jgt15>3.0.Co;2-L |
0.552 |
|
1996 |
Chen G, Piotrowski W, Shreve W. A partition approach to Vizing's conjecture Journal of Graph Theory. 21: 103-111. DOI: 10.1002/(Sici)1097-0118(199601)21:1<103::Aid-Jgt13>3.0.Co;2-M |
0.466 |
|
1995 |
Chen G, Faudree RJ, Gould RJ, Jacobson MS, Lesniak L. Hamiltonicity in balanced k-partite graphs Graphs and Combinatorics. 11: 221-231. DOI: 10.1007/Bf01793008 |
0.593 |
|
1995 |
Chen G, Schelp RH. Hamiltonicity for K 1,r -free graphs Journal of Graph Theory. 20: 423-439. DOI: 10.1002/Jgt.3190200406 |
0.527 |
|
1995 |
Chen G, Rousseau CC. The irredundant Ramsey number s (3,7) Journal of Graph Theory. 19: 263-270. DOI: 10.1002/Jgt.3190190211 |
0.472 |
|
1994 |
Chen G, Gould RJ, Jacobson MS, Schelp RH. Neighborhood unions and the cycle cover number of a graph Journal of Graph Theory. 18: 663-672. DOI: 10.1002/Jgt.3190180703 |
0.563 |
|
1994 |
Chen G, Schelp RH. Hamiltonian graphs with neighborhood intersections Journal of Graph Theory. 18: 497-513. DOI: 10.1002/Jgt.3190180508 |
0.522 |
|
1993 |
Bedrossian P, Chen G, Schelp RH. A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness Discrete Mathematics. 115: 39-50. DOI: 10.1016/0012-365X(93)90476-A |
0.474 |
|
1993 |
Chen G. Hamiltonian graphs involving neighborhood intersections Discrete Mathematics. 112: 253-257. DOI: 10.1016/0012-365X(93)90238-O |
0.576 |
|
1993 |
Chen G, Schelp RH. Graphs with linearly bounded Ramsey numbers Journal of Combinatorial Theory, Series B. 57: 138-149. DOI: 10.1006/Jctb.1993.1012 |
0.494 |
|
1993 |
Erdös P, Chen G, Rousseau C, Schelp R. Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs European Journal of Combinatorics. 14: 183-189. DOI: 10.1006/Eujc.1993.1023 |
0.532 |
|
1993 |
Chen G, Hattingh JH, Rousseau CC. Asymptotic bounds for irredundant and mixed Ramsey numbers Journal of Graph Theory. 17: 193-206. DOI: 10.1002/Jgt.3190170208 |
0.379 |
|
1992 |
Chen G, Schelp RH. Hamiltonian graphs involving distances Journal of Graph Theory. 16: 121-129. DOI: 10.1002/Jgt.3190160203 |
0.528 |
|
1990 |
Chen G. One sufficient condition for hamiltonian graphs Journal of Graph Theory. 14: 501-508. DOI: 10.1002/Jgt.3190140414 |
0.576 |
|
Show low-probability matches. |