Unifying the representation of symmetric crossing families and weakly partitive families☆
References (13)
- et al.
Partitive hypergraphs
Discrete Mathematics
(1981) - et al.
A min-max relation for submodular functions on graphs
Annals of Discrete Mathematics
(1977) - et al.
Approximating clique-width and branch-width
Journal on Combinatorial Theory Series B
(2006) - et al.
Graph minors X: Obstructions to tree-decomposition
Journal on Combinatorial Theory Series B
(1991) - et al.
A representation theorem for union-difference families and application
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This work was done while the first author was a Ph. D. student of Université Montpellier II. For financial support, the authors are grateful to the Norwegian Research Council, project PARALGO, and the French National Research Agency, project GRAAL.
Copyright © 2009 Elsevier B.V. All rights reserved.