The decomposition tree of a biconnected graph

DOI10.1007/S10958-014-2198-ZMaRDI QIDQ906761zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 29 January 2016

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.7196

zbMATH Keywords

connected component of a graph

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The tree of decomposition of a $k$-connected graph by a set $mathfrakS$ of pairwise independent $k$-vertex cutsets is defined as follows. The vertices of this tree are cutsets of $mathfrakS$ and parts of decomposition of the graph by the set $mathfrakS$, each cutset is adjacent to all parts that contain it. We prove, that the graph described above is a tree. The tree of decomposition of a biconnected graph is a particular case of this construction: it is the tree of decomposition of a biconnected graph by the set of all its single cutsets (i.e. 2-vertex cutsets, that are independent with all other 2-vertex cutsets). We show that this tree has much in common with the classic tree of blocks and cutpoints of a connected graph. With the help of the tree of decomposition of a biconnected graph we prove a planarity criterium and find some upper bounds on the chromatic number of this graph. Finally, we study the structure of critical biconnected graphs and prove that each such graph has at least four vertices of degree 2.

Recommendations

• Tree-decompositions of graphs. I
• Decompositions of critical trees with cutwidth k
• The structure of a decomposition of a triconnected graph
• scientific article; zbMATH DE number 2147929
• The decomposition of graphs into \(k\)-connected components

Cites work

• A structural characterization of planar combinatorial graphs
• Critically n-Connected Graphs
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 5161490 (Why is no real title available?)
• scientific article; zbMATH DE number 1960407 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On critically h-connected simple graphs
• The decomposition of graphs into \(k\)-connected components

Cited in

(7)

• The structure of a decomposition of a triconnected graph
• Large contractible subgraphs of a 3-connected graph
• Decomposition of a 2-connected graph into three connected subgraphs
• scientific article; zbMATH DE number 3981211 (Why is no real title available?)
• On semi-reconstruction of graphs of connectivity 2
• Every 3-connected graph with at least 13 vertices has a contractible set with 5 vertices
• On reconstruction of a graph of connectivity 2 having a 2-vertex set dividing it into at least 3 parts

This page was built for publication: The decomposition tree of a biconnected graph

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