M. Ellingham

activity

20162026

most citedSpanning trails with maximum degree at most 4 in

2 K_{2}

-free graphs

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

collaborators

Showing 2024 · math.COShow all

3 papers · 2 filters

math.CO2024

A Fano framework for embeddings of graphs in surfaces

Blake Dunshee, M. N. Ellingham

We consider seven fundamental properties of cellular embeddings of graphs in compact surfaces, and show that each property can be associated with a point of the Fano plane $F$ , in…

math.CO2024

Spanning weakly even trees of graphs

Jiangdong Ai, M. N. Ellingham, Zhipeng Gao +5

Let $G$ be a graph (with multiple edges allowed) and let $T$ be a tree in $G$ . We say that $T$ is $even$ if every leaf of $T$ belongs to the same part of the bipartition o…

math.CO2024★ 1 cited

Maximum genus embeddings of dense eulerian graphs with specified faces

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

We give a density condition for when, subject to a necessary parity condition, an eulerian graph or digraph may be cellularly embedded in an orientable surface so that it has exact…