
Minimum 2vertex strongly biconnected spanning directed subgraph problem
A directed graph G=(V,E) is strongly biconnected if G is strongly connec...
read it

Twinless articulation points and some related problems
Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a t...
read it

On classes of graphs with strongly sublinear separators
For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
read it

A New Connection Between Node and Edge Depth Robust Graphs
We create a graph reduction that transforms an (e, d)edgedepthrobust ...
read it

Metric recovery from directed unweighted graphs
We analyze directed, unweighted graphs obtained from x_i∈R^d by connecti...
read it

A poset metric from the directed maximum common edge subgraph
We study the directed maximum common edge subgraph problem (DMCES) for d...
read it

Graph Surfing in Reaction Systems from a Categorial Perspective
Graphbased reaction systems were recently introduced as a generalizatio...
read it
barticulation points and bbridges 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 bbridge if the subgraph G∖{ e} =(V,E∖{ e}) is not strongly biconnected. A vertex w∈ V is a barticulation 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 barticulation points and bbridges.
READ FULL TEXT
Comments
There are no comments yet.