A matroid analogue of a theorem of Brooks for graphs

DOI10.1016/j.ejc.2015.10.011zbMath1328.05039OpenAlexW2175477348MaRDI QIDQ901151

James G. Oxley

Publication date: 23 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.10.011

zbMATH Keywords

chromatic number\(\mathrm{GF}(p)\)-representable matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The critical number of dense triangle-free binary matroids
• Equicardinal matroids
• On Connectivity in Matroids and Graphs
• Modular Constructions for Combinatorial Geometries
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• A Combinatorial Model for Series-Parallel Networks