The structure of saturated critical blocks

The structure of saturated critical blocks

A 2‐connected graph G is a critical block if G − v is not 2‐connected for every vertex v ∈ V(G). A critical block G is a saturated critical block if G + e is not a critical block for any new edge e. The structure of all saturated critical blocks and a procedure for constructing every saturated criti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory 2003-07, Vol.43 (3), p.223-237
1. Verfasser: Nelson, Donald A.
Format: Artikel
Sprache:eng
Schlagworte:
2-connected
critical block
saturated
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A 2‐connected graph G is a critical block if G − v is not 2‐connected for every vertex v ∈ V(G). A critical block G is a saturated critical block if G + e is not a critical block for any new edge e. The structure of all saturated critical blocks and a procedure for constructing every saturated critical block are determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 223–237, 2003
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.10116