# b-articulation points and b-bridges in strongly biconnected directed graphs

A directed graph G=(V,E) is called strongly biconnected if G is strongly connected and the underlying graph of G is biconnected. This class of directed graphs was first introduced by Wu and Grumbach. Let G=(V,E) be a strongly biconnected directed graph. An edge e∈ E is a b-bridge if the subgraph G∖{ e} =(V,E∖{ e}) is not strongly biconnected. A vertex w∈ V is a b-articulation point if G∖{ w} is not strongly biconnected, where G∖{ w} is the subgraph obtained from G by removing w. In this paper we study b-articulation points and b-bridges.

## Authors

• 7 publications
• ### Minimum 2-vertex strongly biconnected spanning directed subgraph problem

A directed graph G=(V,E) is strongly biconnected if G is strongly connec...
08/02/2020 ∙ by Raed Jaberi, et al. ∙ 0

• ### Twinless articulation points and some related problems

Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a t...
12/26/2019 ∙ by Raed Jaberi, et al. ∙ 0

• ### On classes of graphs with strongly sublinear separators

For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
10/09/2017 ∙ by Zdeněk Dvořák, et al. ∙ 0

• ### A New Connection Between Node and Edge Depth Robust Graphs

We create a graph reduction that transforms an (e, d)-edge-depth-robust ...
10/20/2019 ∙ by Jeremiah Blocki, et al. ∙ 0

• ### Metric recovery from directed unweighted graphs

We analyze directed, unweighted graphs obtained from x_i∈R^d by connecti...
11/20/2014 ∙ by Tatsunori B. Hashimoto, et al. ∙ 0

• ### A poset metric from the directed maximum common edge subgraph

We study the directed maximum common edge subgraph problem (DMCES) for d...
10/31/2019 ∙ by Robert Nerem, et al. ∙ 0