Embedding simply connected 2-complexes in 3-space -- III. Constraint minors

Abstract

We characterise the following property by six obstructions: given a graphic matroid $M$ and a set $X$ of its elements, when is $M$ the cycle matroid of a graph $G$ such that $X$ is a connected edge set in $G$?

References in corpus (1)

• Embedding simply connected 2-complexes in 3-space -- IV. Dual matroids

Cited by in corpus (2)

• Embedding simply connected 2-complexes in 3-space -- IV. Dual matroids
• Multibranched surfaces in 3-manifolds