Connectivity in bicircular matroids (Q1070236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3935058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity in bicircular matroids |
scientific article; zbMATH DE number 3935058 |
Statements
Connectivity in bicircular matroids (English)
0 references
1985
0 references
The concept of n-biconnection introduced in this paper is a form of graph connectivity that is weaker than n-connection. Using this concept, the author presents several results that relate the n-biconnection of a graph with the connectivity of its bicircular matroid. The author emphasizes the analogy between his results and known results that relate n- connection of graphs with the connectivity of their polygon matroids. Special attention is then given to 3-biconnected graphs.
0 references
bicircular matroid
0 references
biconnection
0 references
graph connectivity
0 references
polygon matroids
0 references
0.7556129097938538
0 references
0.7373577952384949
0 references
0.7369470000267029
0 references
0.7362810969352722
0 references
