Decomposition of a 2-connected graph into three connected subgraphs

DOI10.1007/S10958-018-4127-ZzbMath1410.05165OpenAlexW2905166770WikidataQ128749160 ScholiaQ128749160MaRDI QIDQ2632546

Yanyan Li

Publication date: 14 May 2019

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

Full work available at URL: https://doi.org/10.1007/s10958-018-4127-z

zbMATH Keywords

vertex decomposition

Mathematics Subject Classification ID

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

Related Items (1)

On semi-reconstruction of graphs of connectivity 2

Cites Work

• The decomposition tree of a biconnected graph
• Minimal biconnected graphs
• On the structure of a \(k\)-connected graph
• Blocks in \(k\)-connected graphs
• A homology theory for spanning tress of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of a 2-connected graph into three connected subgraphs