Connectivity in bicircular matroids (Q1070236)

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.