A decomposition theory for matroids. IV: Decomposition of graphs

DOI10.1016/0095-8956(88)90073-1zbMath0719.05020OpenAlexW2014299438MaRDI QIDQ2639863

Klaus Truemper

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90073-1

zbMATH Keywords

algorithmminordecomposition theoremsdecomposition of a graphdecomposable graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items

Decomposition and optimization over cycles in binary matroids, A decomposition theory for matroids. V: Testing of matrix total unimodularity, Simplicial decompositions of graphs: A survey of applications

Cites Work

• Unnamed Item
• The max-cut problem on graphs not contractible to \(K_ 5\)
• Bemerkungen zu Hadwigers Vermutung
• A decomposition theory for matroids. I: General results
• A decomposition theory for matroids. II. Minimal violation matroids
• A decomposition theory for matroids. III. Decomposition conditions
• Decomposition of regular matroids
• A decomposition of the matroids with the max-flow min-cut property
• Partial matroid representations
• Connectivity in Matroids