Computing 2-twinless blocks
Raed Jaberi · Discrete Mathematics Letters · 2021
Let G = (V, E) be a directed graph.A 2-twinless block in G is a maximal subset B ⊆ V of size at least 2 such that for every pair of distinct vertices x, y ∈ B, and for every vertex w ∈ V \ {x, y}, the vertices x, y are in the same twinless strongly connected component of G \ {w}.In this paper, algorithms for computing the 2-twinless blocks of a directed graph are presented.