DOIAbstract
AbstractWe 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
AbstractWe 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
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generali...
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 consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize...
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and ...
We start by familiarizing ourselves with edge covers. We review several\ud interesting results for c...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
AbstractFan Chung has recently derived an upper bound on the diameter of a regular graph as a functi...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
AbstractA cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers eve...
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generali...
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 consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize...
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and ...
We start by familiarizing ourselves with edge covers. We review several\ud interesting results for c...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
AbstractFan Chung has recently derived an upper bound on the diameter of a regular graph as a functi...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
AbstractA cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers eve...
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t ≥ 1), which generali...
Add to ORKG