๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A lower bound on connectivities of matroid base graphs

โœ Scribed by Guizhen Liu

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
853 KB
Volume
69
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

On the Structure of 3-connected Matroids
On the Structure of 3-connected Matroids and Graphs
โœ James Oxley; Haidong Wu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne

Lower bound of cyclic edge connectivity
Lower bound of cyclic edge connectivity for n-extendability of regular graphs
โœ Dingjun Lou; D.A. Holton ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 701 KB

A cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is proved that for any m > 0 and k 2 3, there is an (m, k, k) bipartite graph. A graph G is n-extendable if every matching of size n in G lies in a perfect matching of G. We prove the existence of a (k2-1, k + 1