scientific article; zbMATH DE number 3981211
[For the entire collection see Zbl 0601.00003.] A graph G is called biconnected if both G and its complement \(\bar G\) are connected. We denote by B the set of all biconnected graphs. A maximal biconnected induced subgraph of G is called a biconnected component of G. We show that an arbitrary graph can be represented as the union of vertex-disjoint biconnected components. A set of graphs S is said to be normal if \(\bar G\) is contained in S for any graph G in S. The family of graphs characterized by forbidden or unavoidable subgraph set S is denoted by \({\mathfrak F}(S)\) or \({\mathfrak A}(S)\), respectively. Let S be a normal set of biconnected graphs. We denote by \({\mathfrak G}(S)\) the family of graphs obtained from S by repeated applications of the two operations, union and join on S. We have the following structure theorem for \({\mathfrak F}(S):{\mathfrak F}(S)={\mathfrak G}(B-{\mathfrak A}(S))\).
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745870)