Connectivity in bicircular matroids (Q1070236): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(85)90057-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057216302 / rank | |||
Normal rank | |||
Revision as of 22:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity in bicircular matroids |
scientific article |
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
