On the chromatic number of binary matroids

DOI10.1112/S0025579300009876MaRDI QIDQ3852199zbMATH OpenFDO

Authors P. N. Walton, D. J. A. Welsh

Publication date 1980

Published in Mathematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/S0025579300009876

zbMATH Keywords

binary matroidschromatic number

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3852199)