Premium
The structure of saturated critical blocks
Author(s) -
Nelson Donald A.
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10116
Subject(s) - mathematics , combinatorics , block (permutation group theory) , vertex (graph theory) , graph , discrete mathematics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom