COLOURING, PACKING AND THE CRITICAL PROBLEM
From MaRDI portal
Publication:4163238
DOI10.1093/qmath/29.1.11zbMath0384.05021OpenAlexW2030187949MaRDI QIDQ4163238
Publication date: 1978
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/29.1.11
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40)
Related Items (19)
On critical exponents of Dowling matroids ⋮ On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ The number of colorings of planar graphs with no separating triangles ⋮ Sign-Coherent Identities for Characteristic Polynomials of Matroids ⋮ On a covering problem of Mullin and Stanton for binary matroids ⋮ Several identities for the characteristic polynomial of a combinatorial geometry ⋮ A matroid analogue of a theorem of Brooks for graphs ⋮ On Connectivity in Matroids and Graphs ⋮ Is the five-flow conjecture almost false? ⋮ Critical problem for codes over finite chain rings ⋮ On the chromatic number of binary matroids ⋮ Cocircuit coverings and packings for binary matroids ⋮ On a matroid identity ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ A note on the critical problem for matroids ⋮ On Crapo's Beta Invariant for Matroids ⋮ Modularity in tangential k-blocks ⋮ A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
This page was built for publication: COLOURING, PACKING AND THE CRITICAL PROBLEM
