On the Tree Graph of a Matroid

DOI10.1137/0122021zbMath0249.05102OpenAlexW2066220551WikidataQ64005243 ScholiaQ64005243MaRDI QIDQ5661517

C. A. Holzmann, Frank Harary

Publication date: 1972

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0122021

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

The cycle's structure of embedded graphs in surfaces, Clique coverings of graphs V: maximal-clique partitions, Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph, Generating cycle spaces for graphs on surfaces with small genera, Matroid tree graphs and interpolation theorems, Vertex disjoint cycles in intersection graphs of bases of matroids, A lower bound on connectivities of matroid base graphs, Cycles in circuit graphs of matroids, Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen, Basis pair graphs of transversal matroids are connected, Properties of Hamilton cycles of circuit graphs of matroids, The connectivity and diameter of second order circuit graphs of matroids, On the expansion of combinatorial polytopes, Hamiltonicity and combinatorial polyhedra, Hamilton cycles in circuit graphs of matroids, On a tree graph defined by a set of cycles, A pivot Gray code listing for the spanning trees of the fan graph, The \(e\)-exchange basis graph and matroid connectedness, Basis graphs of pregeometries, Flips in planar graphs, Short cycle structure of graphs on surfaces. I: The uniqueness theorems, Paths on polymatroids, The basis graph of a bicolored matroid, The cycle structure for directed graphs on surfaces, A combinatorial ranking problem, The characteristics of cycle-nodes-ratio and its application to network classification, A characterization of complete matroid base graphs, Paths and cycles in matroid base graphs, Sequences of spanning trees and a fixed tree theorem, Interpolation theorems for a family of spanning subgraphs, A constant-time algorithm for middle levels Gray codes, Matroid basis graphs. I, On the basis graph of a bicolored matroid, Geometric tree graphs of points in convex position, Degenerate optimal basis graphs in linear programming, Perspectives on \(A\)-homotopy theory and its applications, Characterizations of matroids with an element lying in a restricted number of circuits, Interpolation theorems for graphs, hypergraphs and matroids, The connectivities of leaf graphs of 2-connected graphs