On a composition of independence systems by circuit identification
From MaRDI portal
Publication:1186136
DOI10.1016/0095-8956(91)90076-VzbMATH Open0759.05092MaRDI QIDQ1186136FDOQ1186136
Authors: Reinhardt Euler, A. R. Mahjoub 
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
- scientific article
- On the intersection of independence systems
- scientific article
- On Systems of Independent Sets
- Systems of conditionally independent sets
- Identifiability of classes of input-output systems
- On independent circuits of a digraph
- scientific article; zbMATH DE number 3885774
- Complexity of identification of input-output systems
- Compact representations of all members of an independence system
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph theory (05C99) Extremal set theory (05D05)
Cites Work
- Title not available (Why is that?)
- On the facial structure of set packing polyhedra
- \(K_ i\)-covers. I: Complexity and polytopes
- Weakly bipartite graphs and the max-cut problem
- On the cycle polytope of a binary matroid
- On the acyclic subgraph polytope
- Compositions in the bipartite subgraph polytope
- Bemerkungen zu Hadwigers Vermutung
- A generalization of max flow—min cut
- On the Maximum Weight Clique Problem
Cited In (18)
- The anti-join composition and polyhedra
- Weightable and regular independent system
- Title not available (Why is that?)
- Conflict hypergraphs to define new families of facets for the independence system polytope
- Complete linear descriptions of small asymmetric traveling salesman polytopes
- Title not available (Why is that?)
- More on independence systems
- On Abstract Integral Dependence
- Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
- Composition of graphs and the triangle-free subgraph polytope
- Facets of the independent path-matching polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-node cutsets and the dominating set polytope
- Networks with unicyclic connected components and without short cycles
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
- Title not available (Why is that?)
This page was built for publication: On a composition of independence systems by circuit identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186136)
