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...
|Place of publication:||
Cham Springer International Publishing 09.10.2020
|published in:||Graph-Theoretic Concepts in Computer Science pp. 352 - 363|
|Data of publication:||20201009|
This research was partially funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (EngageS: grant agreement No. 820148), and the Federal Ministry of Education and Research.
Lecture Notes in Computer Science
|Online Access:||available in Bonn?|
|Database:||Database information not found
Database information Databases - DBIS