M. N. Ellingham

most citedSpanning trails with maximum degree at most 4 in

2 K_{2}

-free graphs

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021

Minimal quadrangulations of surfaces

Wenzhong Liu, M. N. Ellingham, Dong Ye

A quadrangular embedding of a graph in a surface $Σ$ , also known as a quadrangulation of $Σ$ , is a cellular embedding in which every face is bounded by a $4$ -cycle. A quadrangulati…

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…

Minimal quadrangulations of surfaces

Hamiltonicity of planar graphs with a forbidden minor

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

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