相关论文: Minimum $2$-vertex strongly biconnected spanning d…

We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…

An edge subset \( S \subseteq E(G) \) is called a 3-restricted edge-cut if \( G - S \) is disconnected and each component of \( G - S \) contains at least three vertices. The 3-restricted edge-connectivity of a graph \( G \), denoted by \(…

By a well known theorem of Robbins, a graph $G$ has a strongly connected orientation if and only if $G$ is 2-edge-connected and it is easy to find, in linear time, either a cut edge of $G$ or a strong orientation of $G$. A result of Durand…

Let $G$ be a (multi)graph of order $n$ and let $u,v$ be vertices of $G$. The maximum number of internally disjoint $u$-$v$ paths in $G$ is denoted by $\kappa_G(u,v)$, and the maximum number of edge-disjoint $u$-$v$ paths in $G$ is denoted…

The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly,…

An edge subset \( S \subseteq E(G) \) is called a 3-restricted edge-cut if $G-S$ is disconnected and each component of \( G - S \) contains at least three vertices. The 3-restricted edge-connectivity of a graph \( G \), denoted by \(…

We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time…

A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1, \ldots, P_k\) {such that \(P_i\) is a directed path from…

Mader proved that every strongly $k$-connected $n$-vertex digraph contains a strongly $k$-connected spanning subgraph with at most $2kn - 2k^2$ edges, where the equality holds for the complete bipartite digraph ${DK}_{k,n-k}$. For dense…

Given a simple undirected graph $G = (V, E)$, the open neighbourhood of a vertex $v \in V$ is defined as $N_G(v) = \{u \in V \mid uv \in E\}$, and the closed neighbourhood as $N_G[v] = N_G(v) \cup \{v\}$. A subset $D \subseteq V$ is called…

Given a directed simple graph G=(V,E) and a nonnegative-valued cost function the power of a vertex u in a directed spanning subgraph H is given by the maximum cost of an arcs of H exiting u. The power of H is the sum of the power of its…

We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally…

A strong edge-coloring of a graph $G$ is an edge-coloring in which every color class is an induced matching, and the strong chromatic index $\chi_s'(G)$ is the minimum number of colors needed in strong edge-colorings of $G$. A graph is…

For a connected graph G=(V,E), a subset U of V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is…

Let $G(V, E)$ be a simple connected graph, with $|E| = \epsilon.$ In this paper, we define an edge-set graph $\mathcal G_G$ constructed from the graph $G$ such that any vertex $v_{s,i}$ of $\mathcal G_G$ corresponds to the $i$-th…

Let $D=(V,A)$ be a digraph of order $n$, $S$ a subset of $V$ of size $k$ and $2\le k\leq n$. Strong subgraphs $D_1, \dots , D_p$ containing $S$ are said to be internally disjoint if $V(D_i)\cap V(D_j)=S$ and $A(D_i)\cap A(D_j)=\emptyset$…

Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $S\subseteq V (G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V (G)\setminus S$ is connected.…

Given a graph $G=(V,E)$, a subset $X$ of $V$ is an interval of $G$ provided that for any $a, b\in X$ and $ x\in V \setminus X$, $\{a,x\}\in E$ if and only if $\{b,x\}\in E$. For example, $\emptyset$, $\{x\}(x\in V)$ and $V$ are intervals of…

The restricted edge-connectivity of a connected graph $G$, denoted by $\lambda^{\prime}(G)$, if it exists, is the minimum cardinality of a set of edges whose deletion makes $G$ disconnected and each component with at least 2 vertices. It…

We study the 2-edge-connected spanning subgraph (2-ECSS) problem: Given a graph $G$, compute a connected subgraph $H$ of $G$ with the minimum number of edges such that $H$ is spanning, i.e., $V(H) = V(G)$, and $H$ is 2-edge-connected, i.e.,…