Connectivity in bicircular matroids

DOI10.1016/0095-8956(85)90057-7MaRDI QIDQ1070236zbMATH OpenOpenAlexFDO

Authors Donald K. Wagner

Publication date 1985

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(85)90057-7

zbMATH Keywords

bicircular matroidbiconnectiongraph connectivitypolygon matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

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.

Recommendations

• Representations of bicircular matroids
• Connectedness of matroids
• scientific article; zbMATH DE number 952951
• On cocircuit covers of bicircular matroids
• Graph representations of a bicircular matroid

Cites work

• A Combinatorial Decomposition Theory
• BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
• BICIRCULAR MATROIDS
• Connectivity in Matroids
• Graph theory with applications
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• On matroid connectivity
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• On subgraphs as matroid cells
• Presentations of Transversal Matroids

Cited in

(22)

• On the complexity of recognizing a class of generalized networks
• Biased graphs. II: The three matroids
• Representations of bicircular matroids
• Characterizing bias matroids
• Recognizing hidden bicircular networks
• Uncovering generalized-network structure in matrices
• Graph representations of a bicircular matroid
• The family of bicircular matroids closed under duality
• Unavoidable minors of large 4-connected bicircular matroids
• Recognizing a class of bicircular matroids
• Almost balanced biased graph representations of frame matroids
• Bias matroids with unique graphical representations
• Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
• Representations of bicircular lift matroids
• scientific article; zbMATH DE number 1036216 (Why is no real title available?)
• On graphs uniquely defined by their \(K\)-circular matroids
• \(k\)-circular matroids of graphs
• Count and cofactor matroids of highly connected graphs
• Rigidity and reconstruction in matroids of highly connected graphs
• On excluded minors of connectivity 2 for the class of frame matroids
• The structure of bases in bicircular matroids
• Connectivity in frame matroids

This page was built for publication: Connectivity in bicircular matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1070236)