Covering (graph theory)

From Wikipedia, the free encyclopedia

In graph theory, a covering or cover can refer to

• Vertex cover – a set of vertices incident on every edge

• Edge cover – a set of edges incident on every vertex

• Covering graph – a graph related to another graph via a covering map

• A family of subgraphs the union of which is the given graph, and in particular
  • cycle double cover, a family of cycles that includes every edge exactly twice
  • clique cover, a family of cliques that includes every vertex
  • path cover, a family of paths that includes every vertex
  • biclique cover, a family of complete bipartite graphs that includes every edge

This disambiguation page lists mathematics articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article.