2.5-Connectivity: Unique Components, Critical Graphs, and Applications

If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These components are arranged in a tree-structure. We also discus...

Full description

Saved in:
Bibliographic details
Main Author: Heinrich, Irene
Heller, Till
Schmidt, Eva
Streicher, Manuel
Format: Journal Article
Language: English
Place of publication: 03.03.2020
Data of publication: 2020-03-03
Subjects:
Online Access: Fulltext
Database: arXiv Mathematics
arXiv.org
Database information Databases - DBIS