Guoli Ding

activity

20062026

most citedUnavoidable Induced Subgraphs of Large 2-Connected Graphs

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016

Excluding a large theta graph

Guoli Ding, Emily Marshall

A theta graph, denoted $θ_{a, b, c}$ , is a graph of order $a + b + c - 1$ consisting of a pair of vertices and three independent paths between them of lengths $a$ , $b$ , and $c$ . We provide…

math.CO2016

On Box-Perfect Graphs

Guoli Ding, Wenan Zang, Qiulan Zhao

Let $G = (V, E)$ be a graph and let $A_{G}$ be the clique-vertex incidence matrix of $G$ . It is well known that $G$ is perfect iff the system $A_{_{G}} x \leq 1$ , $\mathbf x\…

math.CO2016

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…