Boolean techniques for matroidal decomposition of independence systems and applications to graphs

DOI10.1016/0012-365X(85)90189-XzbMath0575.05019MaRDI QIDQ1063611

C. Benzaken, Peter L. Hammer

Publication date: 1985

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

zbMATH Keywords

graphBoolean functionstable setsindependence systemsmatroidal decompositions

Mathematics Subject Classification ID

Boolean programming (90C09) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (4)

Stable sets versus independent sets ⋮ Minimum partition of an independence system into independent sets ⋮ On the geometric structure of independence systems ⋮ Bimatroidal independence systems

Cites Work

• Introduction to the theory of matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean techniques for matroidal decomposition of independence systems and applications to graphs