On the chromatic number of binary matroids

DOI10.1112/S0025579300009876zbMath0419.05015MaRDI QIDQ3852199

P. N. Walton, Dominic J. A. Welsh

Publication date: 1980

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

chromatic numberbinary matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Supereulerian graphs and excluded induced minors ⋮ Excluding Kuratowski graphs and their duals from binary matroids ⋮ Some heterochromatic theorems for matroids ⋮ On Connectivity in Matroids and Graphs ⋮ Postman tours and cycle covers ⋮ Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries ⋮ The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor. ⋮ The regular matroids with no 5-wheel minor ⋮ Nowhere-zero 4-flow in almost Petersen-minor free graphs ⋮ A note on the critical problem for matroids ⋮ On Crapo's Beta Invariant for Matroids ⋮ A characterization of the ternary matroids with no \(M(K_ 4)\)-minor

Cites Work

• Unnamed Item
• On the chromatic number of regular matroids
• Beweis einer Abschwächung der Hadwiger-Vermutung
• Modular Constructions for Combinatorial Geometries
• Every planar map is four colorable
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• Lectures on matroids
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: On the chromatic number of binary matroids