M. N. Ellingham

most citedSpanning trails with maximum degree at most 4 in

2 K_{2}

-free graphs

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

collaborators

3 papers

math.CO2019★ 2 cited

Toughness and prism-hamiltonicity of $P_{4}$ -free graphs

M. N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan

The \emph{prism} over a graph $G$ is the product $G □ K_{2}$ , i.e., the graph obtained by taking two copies of $G$ and adding a perfect matching joining the two copies of each ver…

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★ 2 cited

Spanning trails with maximum degree at most 4 in $2 K_{2}$ -free graphs

Guantao Chen, M. N. Ellingham, Akira Saito +1

A graph is called $2 K_{2}$ -free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every $\frac{3}{2}$ -tough $2 K_{2}$ -free graph wi…

Toughness and prism-hamiltonicity of P4​-free graphs

Hamiltonicity of planar graphs with a forbidden minor

Spanning trails with maximum degree at most 4 in 2K2​-free graphs

Toughness and prism-hamiltonicity of $P_{4}$ -free graphs

Spanning trails with maximum degree at most 4 in $2 K_{2}$ -free graphs