On the coverings of graphs

  title={On the coverings of graphs},
  author={Fan Chung Graham},
  journal={Discrete Mathematics},
Suppose G is a connected graph’ with vertex set V(G) and edge set E(G). A covering of G is a family of subgraphs, say G1, Gz, . . . , G,, having the property that each edge of G is contained in at least one graph Gi, for some i. If all Gi, 1 s i 6 t, belong to a specified class of graphs H, such a covering is called an Hcovering of G. If we require all… CONTINUE READING