A note on the critical problem for matroids
From MaRDI portal
Recommendations
Cites work
- A Decomposition for Combinatorial Geometries
- COLOURING, PACKING AND THE CRITICAL PROBLEM
- Euler and bipartite matroids
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- Lectures on matroids
- On the chromatic number of binary matroids
- On the enumeration of chains in regular chain-groups
- The Tutte polynomial
Cited in
(12)- Note on a matroid with parity condition
- On critical exponents of Dowling matroids
- Critical problem for codes over finite chain rings
- Some hard problems on matroid spikes
- scientific article; zbMATH DE number 3920480 (Why is no real title available?)
- THE CRITICAL PROBLEM FOR POLYMATROIDS
- Critical problem for a q-analogue of polymatroids
- On bipartite restrictions of binary matroids
- Recursive properties of the characteristic polynomial of weighted lattices
- A note on nongraphic matroids
- The critical number of dense triangle-free binary matroids
- A matroid analogue of a theorem of Brooks for graphs
This page was built for publication: A note on the critical problem for matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794658)