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: Book Chapter
Language: English
Place of publication: Cham Springer International Publishing 09.10.2020
published in: Graph-Theoretic Concepts in Computer Science pp. 352 - 363
Related: Goos, Gerhard
Hartmanis, Juris
Bertino, Elisa
Gao, Wen
Steffen, Bernhard
Woeginger, Gerhard
Yung, Moti
ORCID: 0000-0002-8227-9353
0000-0001-9191-1712
0000-0002-5074-6199
0000-0001-5605-7637
Data of publication: 20201009
ISBN: 9783030604394
303060439X
EISBN: 9783030604400
3030604403
ISSN: 0302-9743
1611-3349
EISSN: 1611-3349
Discipline: Computer Science
Bibliography: 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.
Series: Lecture Notes in Computer Science
Lect.Notes Computer
Subjects:
Online Access: available in Bonn?
Database: Database information not found
Database information Databases - DBIS