A matroid analogue of a theorem of Brooks for graphs

DOI10.1016/J.EJC.2015.10.011zbMATH Open1328.05039OpenAlexW2175477348MaRDI QIDQ901151FDOQ901151

Authors: James 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

Recommendations

• A fractional analogue of Brooks' theorem
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Proof of a conjecture on matroid base graphs
• A note on the critical problem for matroids
• Brooks' theorem for generalized dart graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Combinatorial Model for Series-Parallel Networks
• Title not available (Why is that?)
• Modular Constructions for Combinatorial Geometries
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• On Connectivity in Matroids and Graphs
• The critical number of dense triangle-free binary matroids
• Equicardinal matroids

Cited In (9)

• Tverberg-type theorems for matroids: a counterexample and a proof
• Brooks' theorem on powers of graphs
• A reconfigurations analogue of Brooks' theorem and its consequences
• A short proof of Brooks’ Theorem for vertex arboricity
• A Tverberg type theorem for matroids
• An Erdős-Gallai theorem for matroids
• A generalization of the theorem on forming a matroid from parts
• König's theorem and bimatroids
• Maximal nests of subspaces, the matrix Bruhat decomposition, and the marriage theorem - with an application to graph coloring

This page was built for publication: A matroid analogue of a theorem of Brooks for graphs

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