Conjecture on Euler impure graphs on Dyck's surface

Let N3\mathbb{N}_3 denote Dyck's surface, and let an Euler impure graph be an edge-maximal graph embeddable on a surface that does not triangulate that surface. For a graph GG and a graph HH, write E(H)E(H) for the edge set of HH; thus K8E(H)K_8-E(H) is obtained from K8K_8 by deleting the edges of HH. Conjecture on Euler impure graphs on Dyck's surface. The graphs

K8E(2K2)andK8E(K1,2)K_8-E(2K_2) \quad\text{and}\quad K_8-E(K_{1,2})

are the two unique Euler impure graphs on Dyck's surface N3\mathbb{N}_3. The conjecture proposes a finite characterization of the Euler impure graphs on the remaining non-orientable surface of genus three. The source presents it as a tractable conjectural characterization, and the supplied text gives no evidence that it has been resolved.

Sources & referencesView supporting material

Primary source

James Davies and Florian Pfender, “Edge-maximal graphs on orientable and some non-orientable surfaces”, arXiv:1911.02666 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.