Submodular partition functions

DOI10.1016/j.disc.2009.04.033zbMath1188.05144OpenAlexW2067443074MaRDI QIDQ1045090

Nicolas Nisse, Frédéric Mazoit, Omid Amini, Steéphan Thomassé

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00432698/file/partsub.pdf

zbMATH Keywords

graph theorysubmodularitypartition functionstree-decompositionsBramble number

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (9)

Constructing Brambles ⋮ On objects dual to tree-cut decompositions ⋮ Rank-width: algorithmic and structural results ⋮ Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) ⋮ The mixed search game against an agile and visible fugitive is monotone ⋮ Tangle and Maximal Ideal ⋮ Tangle-tree duality in abstract separation systems ⋮ Partitions versus sets: a case of duality ⋮ Directed Path-Decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid tree-width
• Testing branch-width
• Graph minors. I. Excluding a forest
• Graph minors. X: Obstructions to tree-decomposition
• Quickly excluding a forest
• Graph searching and a min-max theorem for tree-width
• On the monotonicity of games generated by symmetric submodular functions.
• Branch-width and well-quasi-ordering in matroids and graphs.

This page was built for publication: Submodular partition functions