Highly Influenced

# Shortest coverings of graphs with cycles

@article{Bermond1983ShortestCO, title={Shortest coverings of graphs with cycles}, author={Jean-Claude Bermond and Bill Jackson and François Jaeger}, journal={J. Comb. Theory, Ser. B}, year={1983}, volume={35}, pages={297-308} }

- Published 1983 in J. Comb. Theory, Ser. B
DOI:10.1016/0095-8956(83)90056-4

1.1. Definitions All graphs considered are finite, and may contain loops and multiple edges. Let G be a graph. For S g V(G), we denote by w(S) the set of edges of G with exactly one end in S. A k-cut of G is a set of the form w(S) (S E V(G)) with ]w(S)] = k. A bridge is u l-cut. A cycle in a graph is a connected, 2-regular subgraph. The length of a cycle is the number of edges it contains. A digon is a cycle of length two. Given the graph G, a cycle cooer of G is a set g of cycles of G such… CONTINUE READING

Highly Influential

This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS