THE CRITICAL PROBLEM FOR POLYMATROIDS
From MaRDI portal
Recommendations
Cited in
(15)- On the matroids representable over GF(4)
- A geometric theory of hypergraph colouring
- Some excluded-minor theorems for a class of polymatroids
- The Go polynomials of a graph.
- Arrangements, channel assignments, and associated polynomials
- On cardinality constrained polymatroids
- Some remarks on the critical problem
- scientific article; zbMATH DE number 3885922 (Why is no real title available?)
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
- scientific article; zbMATH DE number 952950 (Why is no real title available?)
- Critical problem for a q-analogue of polymatroids
- Recursive properties of the characteristic polynomial of weighted lattices
- A note on the critical problem for matroids
- Monotonicity of polymatroids
- The parity problem of polymatroids without double circuits
This page was built for publication: THE CRITICAL PROBLEM FOR POLYMATROIDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288870)