Embedding simply connected 2-complexes in 3-space -- III. Constraint minors
classification
🧮 math.CO
keywords
connectedmatroidcharacterisecomplexesconstraintcycleedgeelements
read the original 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$?
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.