AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if they are in a common minimum cut of D. It is shown that G is perfect, and consequently that the largest size of a pairwise disjoint collection of minimum cut transversals in D is equal to the size of a minimum cut
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
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...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
© 2021 The Authors. Journal of Graph Theory published by Wiley Periodicals LLCA dicut in a directed ...
Given a directed graph, a directed cut is a cut with all arcs oriented in the same direction, and a ...
We describe a new family of di.graphs, named connectively reducible, for which we prove that the min...
AbstractThe max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded...
AbstractLet C be a crossing family of subsets of the finite set V (i.e., if T, U ∈ C and T ⋔ U ≠ ⊘, ...
AbstractLet C be a crossing family of subsets of the finite set V (i.e., if T, U ∈ C and T ⋔ U ≠ ⊘, ...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
AbstractFrom a digraph D form a graph G whose vertices are the arcs of D, two vertices are joined if...
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...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
© 2021 The Authors. Journal of Graph Theory published by Wiley Periodicals LLCA dicut in a directed ...
Given a directed graph, a directed cut is a cut with all arcs oriented in the same direction, and a ...
We describe a new family of di.graphs, named connectively reducible, for which we prove that the min...
AbstractThe max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded...
AbstractLet C be a crossing family of subsets of the finite set V (i.e., if T, U ∈ C and T ⋔ U ≠ ⊘, ...
AbstractLet C be a crossing family of subsets of the finite set V (i.e., if T, U ∈ C and T ⋔ U ≠ ⊘, ...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
DOI
Add to ORKG