Остановите войну!
for scientists:
default search action
Guoli Ding
- > Home > Persons > Guoli Ding
Publications
- 2023
- [j75]Sarah Allred, Guoli Ding, Bogdan Oporowski:
Unavoidable Induced Subgraphs of Large 2-Connected Graphs. SIAM J. Discret. Math. 37(2): 684-698 (2023) - [j74]Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang:
On Gupta's Codensity Conjecture. SIAM J. Discret. Math. 37(3): 1666-1673 (2023) - 2020
- [j73]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors I: Structural description. J. Comb. Theory, Ser. B 141: 264-294 (2020) - [j72]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory, Ser. B 142: 244-275 (2020) - 2018
- [j68]Guoli Ding, Wenan Zang, Qiulan Zhao:
On box-perfect graphs. J. Comb. Theory, Ser. B 128: 17-46 (2018) - [j66]Guoli Ding, Lei Tan, Wenan Zang:
When Is the Matching Polytope Box-Totally Dual Integral? Math. Oper. Res. 43(1): 64-99 (2018) - 2016
- [j65]Guoli Ding, Chanun Lewchalermvongs, John Maharry:
Graphs with no $\bar P_7$-Minor. Electron. J. Comb. 23(2): 2 (2016) - [j64]Guoli Ding, Stan Dziobiak:
Excluded-Minor Characterization of Apex-Outerplanar Graphs. Graphs Comb. 32(2): 583-627 (2016) - [j63]Guoli Ding, Stan Dziobiak, Haidong Wu:
Large Wk- or K3, t-Minors in 3-Connected Graphs. J. Graph Theory 82(2): 207-217 (2016) - [j62]Guoli Ding, Perry Iverson:
Hall-Type Results for 3-Connected Projective Graphs. J. Graph Theory 82(3): 253-264 (2016) - [j61]Carolyn Chun, Guoli Ding, Dillon Mayhew, James G. Oxley:
Unavoidable Connected Matroids Retaining a Specified Minor. SIAM J. Discret. Math. 30(3): 1590-1606 (2016) - 2015
- [j60]Guoli Ding, Haidong Wu:
Characterizing binary matroids with no P9-minor. Adv. Appl. Math. 70: 70-91 (2015) - 2014
- [j59]Guoli Ding, Perry Iverson:
Internally 4-connected projective-planar graphs. J. Comb. Theory, Ser. B 108: 123-138 (2014) - 2013
- [j56]Guoli Ding, Stan Dziobiak:
On 3-Connected Graphs of Path-Width at Most Three. SIAM J. Discret. Math. 27(3): 1514-1526 (2013) - 2012
- [j55]Mark Bilinski, Kwang Ju Choi, Deborah Chun, Guoli Ding, Stan Dziobiak, Rodrigo Farnham, Perry Iverson, Shirley Leu, Lisa Warshauer Lowrance:
Bandwidth of trees of diameter at most 4. Discret. Math. 312(12-13): 1947-1951 (2012) - [j54]Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang:
Bonds with parity constraints. J. Comb. Theory, Ser. B 102(3): 588-609 (2012) - [j52]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26(3): 1346-1360 (2012) - 2011
- [j51]Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan:
Large non-planar graphs and an application to crossing-critical graphs. J. Comb. Theory, Ser. B 101(2): 111-121 (2011) - 2010
- [j50]Guoli Ding, Stan Dziobiak:
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs. Comb. Probab. Comput. 19(4): 579-591 (2010) - [j48]Carolyn Chun, Guoli Ding:
Unavoidable topological minors of infinite graphs. Discret. Math. 310(24): 3512-3522 (2010) - 2009
- [j46]Xujin Chen, Guoli Ding, Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs. Discret. Appl. Math. 157(1): 118-125 (2009) - [j43]Carolyn Chun, Guoli Ding, Bogdan Oporowski, Dirk L. Vertigan:
Unavoidable parallel minors of 4-connected graphs. J. Graph Theory 60(4): 313-326 (2009) - [j41]Guoli Ding, Wenan Zang:
Packing circuits in matroids. Math. Program. 119(1): 137-168 (2009) - 2008
- [j39]Xujin Chen, Guoli Ding, Wenan Zang:
A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33(2): 497-512 (2008) - [j38]Guoli Ding, Li Feng, Wenan Zang:
The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114(2): 321-334 (2008) - 2007
- [c6]Tong Yi, Guoli Ding, Bogdan Oporowski:
A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. IPCCC 2007: 142-149 - 2006
- [j34]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. Math. Oper. Res. 31(4): 777-788 (2006) - 2005
- [c3]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC 2005: 126-135 - 2004
- [j31]Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory, Ser. B 91(1): 25-41 (2004) - 2003
- [j28]Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan:
Partitioning into graphs with only small components. J. Comb. Theory, Ser. B 87(2): 231-243 (2003) - [j27]Guoli Ding, Zhenzhen Xu, Wenan Zang:
Packing cycles in graphs, II. J. Comb. Theory, Ser. B 87(2): 244-253 (2003) - 2002
- [j25]Guoli Ding, Wenan Zang:
Packing Cycles in Graphs. J. Comb. Theory, Ser. B 86(2): 381-407 (2002) - 2001
- [j24]Guoli Ding, Thor Johnson, Paul D. Seymour:
Spanning trees with many leaves. J. Graph Theory 37(4): 189-197 (2001) - 2000
- [j23]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan:
Surfaces, Tree-Width, Clique-Minors, and Partitions. J. Comb. Theory, Ser. B 79(2): 221-246 (2000) - 1998
- [j22]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan:
Partitioning Graphs of Bounded Tree-Width. Comb. 18(1): 1-12 (1998) - 1997
- [j19]Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan:
Unavoidable Minors of Large 3-Connected Matroids. J. Comb. Theory, Ser. B 71(2): 244-293 (1997) - 1996
- [j17]Guoli Ding, Bogdan Oporowski:
On tree-partitions of graphs. Discret. Math. 149(1-3): 45-58 (1996) - [j15]Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan:
Unavoidable Minors of Large 3-Connected Binary Matroids. J. Comb. Theory, Ser. B 66(2): 334-360 (1996) - 1995
- [j13]Guoli Ding, Bogdan Oporowski, James G. Oxley:
On Infinite Antichains of Matroids. J. Comb. Theory, Ser. B 63(1): 21-40 (1995) - [j12]Guoli Ding, Bogdan Oporowski:
Some results on tree decomposition of graphs. J. Graph Theory 20(4): 481-499 (1995) - 1994
- [j10]Guoli Ding, Paul D. Seymour, Peter Winkler:
Bounding the Vertex Cover Number of a Hypergraph. Comb. 14(1): 23-34 (1994) - 1993
- [j4]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. J. Comb. Theory, Ser. B 58(1): 40-45 (1993) - 1992
- [j2]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem. SIAM J. Discret. Math. 5(1): 112-116 (1992)
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-04-25 02:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint