Connectivity in bicircular matroids
type: Item
instance of: scholarly article
title: Connectivity in bicircular matroids
zbMATH Open document ID: 0584.05019
DOI: 10.1016/0095-8956(85)90057-7
author: Donald K. Wagner
published in: Journal of Combinatorial Theory. Series B
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 3935058
zbMATH Keywords: bicircular matroid
zbMATH Keywords: biconnection
zbMATH Keywords: graph connectivity
zbMATH Keywords: polygon matroids
MaRDI profile type: Publication
full work available at URL: 0095-8956(85)90057-7
OpenAlex ID: W2057216302
cites work: Q3097395
cites work: Presentations of Transversal Matroids
cites work: On matroid connectivity
cites work: A Combinatorial Decomposition Theory
cites work: BICIRCULAR MATROIDS
cites work: On subgraphs as matroid cells
cites work: On matroids on edge sets of graphs with connected subgraphs as circuits. II
cites work: Connectivity in Matroids
cites work: Q4111952
cites work: BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
description: scientific article; zbMATH DE number 3935058