M. Ellingham

activity

20092026

most citedQuadrangular embeddings of complete graphs and the Even Map Color Theorem (with details)

10 citations · 19 across the 21 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017★ 1 cited

Edge-outer graph embedding and the complexity of the DNA reporter strand problem

M. N. Ellingham, Joanna A. Ellis-Monaghan

In 2009, Jonoska, Seeman and Wu showed that every graph admits a route for a DNA reporter strand, that is, a closed walk covering every edge either once or twice, in opposite direc…

math.CO2017

Toughness and spanning trees in $K_{4}$ -minor-free graphs

M. N. Ellingham, Songling Shan, Dong Ye +1

For an integer $k$ , a $k$ -tree is a tree with maximum degree at most $k$ . More generally, if $f$ is an integer-valued function on vertices, an $f$ -tree is a tree in which each vert…

Edge-outer graph embedding and the complexity of the DNA reporter strand problem

Toughness and spanning trees in K4​-minor-free graphs

Toughness and spanning trees in $K_{4}$ -minor-free graphs