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

math.CO2016★ 10 cited

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

Wenzhong Liu, Serge Lawrencenko, Beifang Chen +5

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_{n}$ for $n \equiv 5 (mod 8)$ , and nonorientable ones for $n \geq 9$ and $n\equiv 1 \pmod…

Hamiltonicity of planar graphs with a forbidden minor

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

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

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