A constructive approach to the critical problem for matroids
From MaRDI portal
Publication:1160185
DOI10.1016/S0195-6698(81)80005-4zbMath0476.05026OpenAlexW1990513760MaRDI QIDQ1160185
Publication date: 1981
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80005-4
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
The critical number of dense triangle-free binary matroids ⋮ Grassmann homomorphism and Hajós-type theorems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flows and generalized coloring theorems in graphs
- On the algebraic theory of graph colorings
- Euler and bipartite matroids
- A Combinatorial Model for Series-Parallel Networks
- A Decomposition for Combinatorial Geometries
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: A constructive approach to the critical problem for matroids