☰

Guoli Ding - Publications

Affiliations: 
Louisiana State University, Baton Rouge, LA, United States 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

61 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Chen X, Ding G, Zang W, Zhao Q. Ranking tournaments with no errors I: Structural description Journal of Combinatorial Theory, Series B. 141: 264-294. DOI: 10.1016/J.Jctb.2019.08.004  0.333
2019 Qin C, Ding G. A chain theorem for 4-connected graphs Journal of Combinatorial Theory, Series B. 134: 341-349. DOI: 10.1016/J.Jctb.2018.07.005  0.481
2018 Ding G, Fallon J, Marshall E. On Almost-Planar Graphs Electronic Journal of Combinatorics. 25: 1-55. DOI: 10.37236/6591  0.533
2018 Ding G, Marshall E. Excluding a large theta graph Journal of Combinatorial Theory, Series B. 132: 47-79. DOI: 10.1016/J.Jctb.2018.03.002  0.383
2018 Ding G, Zang W, Zhao Q. On box-perfect graphs Journal of Combinatorial Theory, Series B. 128: 17-46. DOI: 10.1016/J.Jctb.2017.07.001  0.536
2018 Ding G, Marshall E. Minimal k-Connected Non-Hamiltonian Graphs Graphs and Combinatorics. 34: 289-312. DOI: 10.1007/S00373-018-1874-Z  0.493
2017 Ding G, Tan L, Zang W. When Is the Matching Polytope Box-Totally Dual Integral? Mathematics of Operations Research. 43: 64-99. DOI: 10.1287/Moor.2017.0852  0.476
2016 Chun C, Ding G, Mayhew D, Oxley JG. Unavoidable Connected Matroids Retaining a Specified Minor Siam Journal On Discrete Mathematics. 30: 1590-1606. DOI: 10.1137/14096089X  0.328
2016 Ding G, Dziobiak S. Excluded-Minor Characterization of Apex-Outerplanar Graphs Graphs and Combinatorics. 32: 583-627. DOI: 10.1007/S00373-015-1611-9  0.497
2016 Ding G, Iverson P. Hall-type results for 3-connected projective graphs Journal of Graph Theory. 82: 253-264. DOI: 10.1002/Jgt.21899  0.489
2016 Ding G, Dziobiak S, Wu H. Large W k - Or K 3, t -Minors in 3-Connected Graphs Journal of Graph Theory. 82: 207-217. DOI: 10.1002/Jgt.21895  0.503
2014 Ding G, Iverson P. Internally 4-connected projective-planar graphs Journal of Combinatorial Theory. Series B. 108: 123-138. DOI: 10.1016/J.Jctb.2014.03.003  0.45
2013 Ding G, Dziobiak S. On 3-Connected Graphs of Path-Width at Most Three Siam Journal On Discrete Mathematics. 27: 1514-1526. DOI: 10.1137/100800452  0.47
2013 Ding G, Liu C. Excluding a small minor Discrete Applied Mathematics. 161: 355-368. DOI: 10.1016/J.Dam.2012.09.001  0.482
2013 Ding G. A characterization of graphs with no octahedron minor Journal of Graph Theory. 74: 143-162. DOI: 10.1002/Jgt.21699  0.459
2012 Chen X, Ding G, Hu X, Zang W. The Maximum-Weight Stable Matching Problem: Duality and Efficiency Siam Journal On Discrete Mathematics. 26: 1346-1360. DOI: 10.1137/120864866  0.395
2012 Ding G, Liu C. A Chain Theorem for $3^+$-Connected Graphs Siam Journal On Discrete Mathematics. 26: 102-113. DOI: 10.1137/110834408  0.516
2012 Chen X, Ding G, Yu X, Zang W. Bonds with parity constraints Journal of Combinatorial Theory, Series B. 102: 588-609. DOI: 10.1016/J.Jctb.2011.08.005  0.409
2012 Bilinski M, Choi KJ, Chun D, Ding G, Dziobiak S, Farnham R, Iverson P, Leu S, Lowrance LW. Bandwidth of trees of diameter at most 4 Discrete Mathematics. 312: 1947-1951. DOI: 10.1016/J.Disc.2012.03.006  0.456
2011 Ding G, Oporowski B, Thomas R, Vertigan D. Large non-planar graphs and an application to crossing-critical graphs Journal of Combinatorial Theory. Series B. 101: 111-121. DOI: 10.1016/J.Jctb.2010.12.001  0.492
2010 Ding G, Dziobiak S. Vertex-bipartition method for colouring minor-closed classes of graphs Combinatorics, Probability & Computing. 19: 579-591. DOI: 10.1017/S0963548310000076  0.505
2010 Chun C, Ding G. Unavoidable topological minors of infinite graphs Discrete Mathematics. 310: 3512-3522. DOI: 10.1016/J.Disc.2010.08.014  0.516
2010 Ding G, Kanno J. Splitter theorems for 4-regular graphs Graphs and Combinatorics. 26: 329-344. DOI: 10.1007/S00373-010-0916-Y  0.688
2009 Ding G. On canonical antichains Discrete Mathematics. 309: 1123-1134. DOI: 10.1016/J.Disc.2007.12.018  0.362
2009 Ding G. The edge version of Hadwiger's conjecture Discrete Mathematics. 309: 1118-1122. DOI: 10.1016/J.Disc.2007.12.017  0.466
2009 Chen X, Ding G, Zang W. The box-TDI system associated with 2-edge connected spanning subgraphs Discrete Applied Mathematics. 157: 118-125. DOI: 10.1016/J.Dam.2008.05.001  0.411
2009 Ding G, Kanno J, Su J. Generating 5-regular planar graphs Journal of Graph Theory. 61: 219-240. DOI: 10.1002/Jgt.V61:3  0.388
2009 Chun C, Ding G, Oporowski B, Vertigan D. Unavoidable parallel minors of 4-connected graphs Journal of Graph Theory. 60: 313-326. DOI: 10.1002/Jgt.V60:4  0.462
2008 Ding G, Lax RF, Chen J, Chen PP. Formulas for approximating pseudo-Boolean random variables Discrete Applied Mathematics. 156: 1581-1597. DOI: 10.1016/J.Dam.2007.08.034  0.306
2008 Ding G, Feng L, Zang W. The complexity of recognizing linear systems with certain integrality properties Mathematical Programming. 114: 321-334. DOI: 10.1007/S10107-007-0103-Y  0.302
2007 Ding G, Chen J, Lax RF, Chen PP. Graph-theoretic method for merging security system specifications Information Sciences. 177: 2152-2166. DOI: 10.1016/J.Ins.2006.12.004  0.428
2006 Ding G, Otlov A˘. On minimal rank over finite fields Electronic Journal of Linear Algebra. 15: 16. DOI: 10.13001/1081-3810.1231  0.46
2006 Chen X, Ding G, Hu X, Zang W. A Min-Max Relation on Packing Feedback Vertex Sets Mathematics of Operations Research. 31: 777-788. DOI: 10.1287/Moor.1060.0200  0.482
2006 DING G, KANNO J. Splitter Theorems for Cubic Graphs Combinatorics, Probability and Computing. 15: 355. DOI: 10.1017/S0963548305007340  0.678
2005 Seiden SS, Chen PP, Lax RF, Chen J, Ding G. New bounds for randomized busing Theoretical Computer Science. 332: 63-81. DOI: 10.1016/J.Tcs.2004.09.039  0.42
2004 DeVos M, Ding G, Oporowski B, Sanders DP, Reed B, Seymour P, Vertigan D. Excluding any graph as a minor allows a low tree-width 2-coloring Journal of Combinatorial Theory. Series B. 91: 25-41. DOI: 10.1016/J.Jctb.2003.09.001  0.54
2004 Ding G, Chen P. Unavoidable doubly connected large graphs Discrete Mathematics. 280: 1-12. DOI: 10.1016/J.Disc.2003.05.006  0.511
2003 Ding G, Chen P. Generating r -regular graphs Discrete Applied Mathematics. 129: 329-343. DOI: 10.1016/S0166-218X(02)00593-0  0.459
2003 Ding G, Xu Z, Zang W. Packing cycles in graphs, II Journal of Combinatorial Theory. Series B. 87: 244-253. DOI: 10.1016/S0095-8956(02)00007-2  0.512
2003 Alon N, Ding G, Oporowski B, Vertigan D. Partitioning into graphs with only small components Journal of Combinatorial Theory. Series B. 87: 231-243. DOI: 10.1016/S0095-8956(02)00006-0  0.509
2002 Ding G. On interval clutters Discrete Mathematics. 254: 89-102. DOI: 10.1016/S0012-365X(01)00354-5  0.327
2002 Ding G, Zang W. Packing cycles in graphs Journal of Combinatorial Theory. Series B. 86: 381-407. DOI: 10.1006/Jctb.2002.2134  0.481
2001 Ding G, Johnson T, Seymour P. Spanning trees with many leaves Journal of Graph Theory. 37: 189-197. DOI: 10.1002/Jgt.V37:4  0.47
2000 Ding G, Oporowski B, Sanders DP, Vertigan D. Surfaces, Tree-Width, Clique-Minors, and Partitions Journal of Combinatorial Theory. Series B. 79: 221-246. DOI: 10.1006/Jctb.2000.1962  0.503
1998 Ding G, Oporowski B, Sanders DP, Vertigan D. Partitioning Graphs of Bounded Tree-Width Combinatorica. 18: 1-12. DOI: 10.1007/S004930050001  0.485
1998 Ding G. Chordal Graphs, Interval Graphs, and wqo Journal of Graph Theory. 28: 105-114. DOI: 10.1002/(Sici)1097-0118(199806)28:2<>1.0.Co;2-2  0.509
1997 Ding G, Hammer PL. Matroids arisen from matrogenic graphs Discrete Mathematics. 211-217. DOI: 10.1016/S0012-365X(96)00171-9  0.526
1996 Ding G, Oporowski B. On tree-partitions of graphs Discrete Mathematics. 149: 45-58. DOI: 10.1016/0012-365X(94)00337-I  0.523
1996 Ding G. Bounding the number of circuits of a graph Combinatorica. 16: 331-341. DOI: 10.1007/Bf01261319  0.528
1996 Ding G. Excluding a long double path minor Journal of Combinatorial Theory. Series B. 66: 11-23. DOI: 10.1006/Jctb.1996.0002  0.544
1995 Ding G, Oporowski B, Oxley J. On Infinite Antichains of Matroids Journal of Combinatorial Theory, Series B. 63: 21-40. DOI: 10.1006/Jctb.1995.1003  0.335
1995 Ding G. Graphs with not too many spanning trees Networks. 25: 193-197. DOI: 10.1002/Net.3230250405  0.519
1995 Ding G, Oporowski B. Some results on tree decomposition of graphs Journal of Graph Theory. 20: 481-499. DOI: 10.1002/Jgt.3190200412  0.479
1994 Ding G. Recognizing the P4-structure of a tree Graphs and Combinatorics. 10: 323-328. DOI: 10.1007/Bf02986682  0.43
1993 Ding G. Clutters with τ2=2τ Discrete Mathematics. 115: 141-152. DOI: 10.1016/0012-365X(93)90484-B  0.328
1993 Ding G. Stable sets versus independent sets Discrete Mathematics. 117: 73-87. DOI: 10.1016/0012-365X(93)90325-N  0.491
1993 Ding GL, Schrijver A, Seymour PD. Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle Journal of Combinatorial Theory, Series B. 58: 40-45. DOI: 10.1006/Jctb.1993.1029  0.465
1992 Ding G, Schrijver A, Seymour PD. Disjoint paths in a planar graph—a general theorem Siam Journal On Discrete Mathematics. 5: 112-116. DOI: 10.1137/0405009  0.383
1992 Ding G. Subgraphs and well‐quasi‐ordering Journal of Graph Theory. 16: 489-502. DOI: 10.1002/Jgt.3190160509  0.47
1991 Ding G. Covering the edges with consecutive sets Journal of Graph Theory. 15: 559-562. DOI: 10.1002/Jgt.3190150508  0.513
1987 Ding G. On the maximum 2-1 matching Acta Mathematicae Applicatae Sinica. 3: 305-312. DOI: 10.1007/Bf02008368  0.468
Show low-probability matches.