Subscribe to Events
2-connected graphs, 3-connected graphs, and k-blocks
Pablo Blanco
Location: HLL-701
Date & time: Wednesday, 05 March 2025 at 12:15PM - 1:15PM
Abstract:
In this talk, I will first talk about 2-connected and 3-connected graphs and their constructions. Then, move on to the more general notion of k-blocks (of (k-1)-connected graphs) which can be used to yield a graph decomposition.
The talk will mostly follow Diestel's Graph Theory (Ch. 3) as well as a paper he co-authored (https://arxiv.org/pdf/1305.4557).
The paper is "k-Blocks: a connectivity invariant for graphs" by Carmesin, Diestel, Hamann, Hundertmark
In this talk, I will first talk about 2-connected and 3-connected graphs and their constructions. Then, move on to the more general notion of k-blocks (of (k-1)-connected graphs) which can be used to yield a graph decomposition.
The talk will mostly follow Diestel's Graph Theory (Ch. 3) as well as a paper he co-authored (https://arxiv.org/pdf/1305.4557).
The paper is "k-Blocks: a connectivity invariant for graphs" by Carmesin, Diestel, Hamann, Hundertmark