Mike Pierce

most citedSix variations on a theme: almost planar graphs

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

collaborators

2 papers

math.CO2016★ 9 cited

Six variations on a theme: almost planar graphs

Max Lipton, Eoin Mackall, Thomas W. Mattman +4

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G - v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-…

math.CO2016★ 2 cited

The $K_{n + 5}$ and $K_{3^{2}, 1^{n}}$ families are obstructions to $n$ -apex

Thomas W. Mattman, Mike Pierce

We give evidence in support of a conjecture that the $\nabla$ Y $\nabla$ families of $K_{n + 5}$ and $K_{3^{2}, 1^{n}}$ are obstructions for the $n$ -apex property.

Six variations on a theme: almost planar graphs

The Kn+5​ and K32,1n​ families are obstructions to n-apex

The $K_{n + 5}$ and $K_{3^{2}, 1^{n}}$ families are obstructions to $n$ -apex