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

2017/09/14 by Johannes Carmesin, Carmesin, Johannes · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Digital Image Processing Techniques #Topological and Geometric Data Analysis #math.CO #msc:05C10 #msc:05C65 #msc:05C83

paper · pdf · doi:10.48550/arxiv.1709.04645

arxiv created 2017/09/14 · arxiv updated 2017/09/15

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?

Cited by

• Embedding simply connected 2-complexes in 3-space -- V. A refined Kuratowski-type characterisation
• Embedding simply connected 2-complexes in 3-space -- IV. Dual matroids

Related

• Embedding simply connected 2-complexes in 3-space -- IV. Dual matroids
• Dual matroids of 2-complexes -- revisited
• Embedding simply connected 2-complexes in 3-space
• On K₅ and K_3,3-minors of graphs and regular matroids
• Matroid 3-connectivity and branch width