Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 271-276 |
| Number of pages | 6 |
| Journal | Journal of Combinatorial Theory, Series B |
| Volume | 51 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1991 |