1 citations · 2 across the 8 of their papers we have counts for
11 papers · 1 filter
On extending induced subgraphs
Guoli Ding, Jake Weber, Weihao Xia
When characterizing graphs defined by forbidden induced subgraphs, it is often desirable to understand how a graph can be generated incrementally from a given induced subgraph…
Unavoidable Induced Subgraph of Infinite 2-connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph co…
Strengthened chain theorems for different versions of 4-connectivity
Guoli Ding, Chengfu Qin
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel by repeatedly adding edges and splitting vertices. It is not difficult to prove…
Unavoidable Induced Subgraphs of Large 2-Connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
Ramsey proved that for every positive integer , every sufficiently large graph contains an induced or . Among the many extensions of Ramsey's Theorem there…
On Gupta's Co-density Conjecture
Yan Cao, Guantao Chen, Guoli Ding +2
Let be a multigraph. The {\em cover index} of is the greatest integer for which there is a coloring of with colors such that each vertex of is…
Graphs without large -minors
Guoli Ding
The purpose of this paper is to characterize graphs that do not have a large -minor. As corollaries, it is proved that, for any given positive integer , every sufficien…
Excluding a large theta graph
Guoli Ding, Emily Marshall
A theta graph, denoted , is a graph of order consisting of a pair of vertices and three independent paths between them of lengths , , and . We provide…
On Box-Perfect Graphs
Guoli Ding, Wenan Zang, Qiulan Zhao
Let be a graph and let be the clique-vertex incidence matrix of . It is well known that is perfect iff the system , $\mathbf x\…
On almost-planar graphs
Guoli Ding, Joshua Fallon, Emily Marshall
A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his d…
Large Non-Planar Graphs and an Application to Crossing-Critical Graphs
Guoli Ding, Bogdan Oporowski, Robin Thomas +1
We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K_{4,k}, the grap…
Unavoidable Parallel Minors of 4-Connected Graphs
Carolyn Chun, Guoli Ding, Bogdan Oporowski +1
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected…