We characterize adjacency of edge covers on the edge cover polytope of a graph G = (V, E), and derive that the diameter of the edge cover polytope is equal to |E| - ¿(G), where ¿(G) is the minimum size of an edge cover
We determine the minimum number of edges in a connected r-graph with covering number α and character...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generali...
We define the notion of a vertex cover with radius 2 in an undirected graph. A proof showing that it...
We characterize adjacency of edge covers on the edge cover polytope of a graph G = (V, E), and deriv...
AbstractWe characterize adjacency of edge covers on the edge cover polytope of a graph G = (V, E), a...
AbstractWe consider the concepts of a t-total vertex cover and a t-total edge cover (t⩾1), which gen...
We start by familiarizing ourselves with edge covers. We review several\ud interesting results for c...
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and ...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize...
AbstractFan Chung has recently derived an upper bound on the diameter of a regular graph as a functi...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
AbstractA cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers eve...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generali...
We define the notion of a vertex cover with radius 2 in an undirected graph. A proof showing that it...
We characterize adjacency of edge covers on the edge cover polytope of a graph G = (V, E), and deriv...
AbstractWe characterize adjacency of edge covers on the edge cover polytope of a graph G = (V, E), a...
AbstractWe consider the concepts of a t-total vertex cover and a t-total edge cover (t⩾1), which gen...
We start by familiarizing ourselves with edge covers. We review several\ud interesting results for c...
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and ...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize...
AbstractFan Chung has recently derived an upper bound on the diameter of a regular graph as a functi...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
AbstractA cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers eve...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generali...
We define the notion of a vertex cover with radius 2 in an undirected graph. A proof showing that it...
DOI
Add to ORKG