Matroid basis graphs. II

Abstract

AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are now tied more specifically to aspects of matroids themselves. Factorizations of basis graphs and disconnections of neighborhood subgraphs are related to matroid separations. Matroids are characterized whose basis graphs have only one or two of the three types of common neighbor subgraphs. The notion of leveling is generalized and related to matroid sums, minors, and duals. Also, the problem of characterizing regular and graphic matroids through their basis graphs is discussed. Throughout, many results are obtained quite easily with the aid of certain pseudo-combivalence systems of 0–1 matrices