✦ LIBER ✦

On the Tree Graph of a Matroid

✍ Scribed by Holzmann, Carlos A.; Harary, Frank

Book ID: 118196381
Publisher: Society for Industrial and Applied Mathematics
Year: 1972
Tongue: English
Weight: 687 KB
Volume: 22
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0122021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Cocircuit Graph of an Oriented Ma

On the Cocircuit Graph of an Oriented Matroid

✍ Cordovil, R.; Fukuda, K.; Guedes de Oliveira, A. 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 76 KB

The basis graph of a bicolored matroid

✍ Ana Paulina Figueroa; Eduardo Rivera-Campo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 206 KB

On matroid separations of graphs

✍ Klaus Truemper 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

Let K be a connected and undirected graph, and M be the polygon matroid of K . Assume that, for some k 2 1, the matroid M is kseparable and k-connected according to the matroid separability and connectivity definitions of W. T. Tutte. In this paper we classify the matroid kseparations of M in terms

Two matroidal families on the edge set o

Two matroidal families on the edge set of a graph

✍ András Recski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 109 KB

On a matroid defined by ear-decompositio

On a matroid defined by ear-decompositions of graphs

✍ Zoltán Szigeti 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 486 KB

A lower bound on connectivities of matro

A lower bound on connectivities of matroid base graphs

✍ Guizhen Liu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 853 KB

The connectivity of a graph G and the corank of a matroid M are denoted by K(G) and p, respectively. X is shown that if a graph G is the base graph of a simple mat&d M, then K(G) L 2p and the lower bound of 2p izA best possible.