It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs.
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyun...
It is easily shown that every digraph withm edges has a directed cut of size at least m/4, and that ...
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that...
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that...
International audienceFor integers m,k ≥ 1, we investigate the maximum size of a directed cut in dir...
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the...
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the...
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the...
© 2021 The Authors. Journal of Graph Theory published by Wiley Periodicals LLCA dicut in a directed ...
International audienceGiven a directed graph, an acyclic set is a set of vertices inducing a directe...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
We study a new problem on digraphs, Maximum Directed Linear Arrangement (MaxDLA). This is a directed...
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyun...
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyun...
It is easily shown that every digraph withm edges has a directed cut of size at least m/4, and that ...
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that...
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that...
International audienceFor integers m,k ≥ 1, we investigate the maximum size of a directed cut in dir...
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the...
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the...
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the...
© 2021 The Authors. Journal of Graph Theory published by Wiley Periodicals LLCA dicut in a directed ...
International audienceGiven a directed graph, an acyclic set is a set of vertices inducing a directe...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
We study a new problem on digraphs, Maximum Directed Linear Arrangement (MaxDLA). This is a directed...
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyun...
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyun...