E. Marshall

activity

20132016

most citedCircumference and Pathwidth of Highly Connected Graphs

5 citations · 6 across the 6 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016★ 1 cited

Hamiltonicity of planar graphs with a forbidden minor

M. N. Ellingham, Emily A. Marshall, Kenta Ozeki +1

Tutte showed that $4$ -connected planar graphs are Hamiltonian, but it is well known that $3$ -connected planar graphs need not be Hamiltonian. We show that $K_{2, 5}$ -minor-free $3$ -…

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 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…