Partitions versus sets: a case of duality

DOI10.1016/j.ejc.2009.09.004zbMath1218.05141OpenAlexW2065166691MaRDI QIDQ966122

Frédéric Mazoit, Laurent Lyaudet, Steéphan Thomassé

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.09.004

zbMATH Keywords

dual combinatorial objectset of partitionssubmodular partition functiontree decompositio

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Constructing Brambles ⋮ On objects dual to tree-cut decompositions ⋮ Rank-width: algorithmic and structural results ⋮ The mixed search game against an agile and visible fugitive is monotone ⋮ Tangle and Maximal Ideal ⋮ Tangle-tree duality in abstract separation systems

Cites Work

• Unnamed Item
• Graph minors. III. Planar tree-width
• Matroid tree-width
• Testing branch-width
• Submodular partition functions
• Graph minors. X: Obstructions to tree-decomposition
• Computability of Width of Submodular Partition Functions

This page was built for publication: Partitions versus sets: a case of duality