Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

DOI10.1007/978-3-319-12340-0_1zbMath1409.05045arXiv1406.3798OpenAlexW59238524MaRDI QIDQ2945175

Reinhard Diestel, Sang-il Oum

Publication date: 9 September 2015

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.3798

zbMATH Keywords

general duality theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Distance in graphs (05C12)

Related Items (10)

Duality Theorems for Blocks and Tangles in Graphs ⋮ Refining a Tree-Decomposition which Distinguishes Tangles ⋮ Rank-width: algorithmic and structural results ⋮ Ends and tangles ⋮ Tangles and Hierarchical Clustering ⋮ Tangle and Maximal Ideal ⋮ On the Block Number of Graphs ⋮ Unnamed Item ⋮ Directed Path-Decompositions ⋮ Tangle and ultrafilter: game theoretical interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid tree-width
• Addendum to matroid tree-width
• Submodular partition functions
• Graph minors. X: Obstructions to tree-decomposition
• Quickly excluding a forest
• Graph searching and a min-max theorem for tree-width
• Call routing and the ratcatcher
• Approximating clique-width and branch-width
• Obstructions to branch-decomposition of matroids

This page was built for publication: Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)