Variations on a theme of Graham and

@inproceedings{Cioaba2012VariationsOA,
  title={Variations on a theme of Graham and},
  author={Sebastian M. Cioaba and Michael Tait},
  year={2012}
}
Graham and Pollak proved that one needs at least n − 1 complete bipartite subgraphs (bicliques) to partition the edge set of the complete graph on n vertices. In this paper, we study the extension of Graham and Pollak’s result to coverings of a graph G where each edge of G is allowed to be covered a specified number of times and its generalization to… CONTINUE READING