Shortest coverings of graphs with cycles

  title={Shortest coverings of graphs with cycles},
  author={Jean-Claude Bermond and Bill Jackson and François Jaeger},
  journal={J. Comb. Theory, Ser. B},
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


Publications citing this paper.
Showing 1-10 of 42 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

RODEH, Covering a graph by circuits, in Automata, Languages, and Programming, Lecture Notes

  • M. A. ITAI
  • 1978
Highly Influential
6 Excerpts

Sums of circuits, in “Graph Theory and Related Topics,

  • 1979

A reduction method for edge-connectivity in graphs, in “Advances in Graph Theory,

  • W. MADER
  • Annals of Discrete Math.,
  • 1978
1 Excerpt

HAKEN, Every planar map is four colorable

  • W. K. APPEL
  • Illinois J. Math
  • 1977

Eine gemeinsame Basis fiir die

  • Theorie der Eulerschen Graphen und den Satz von…
  • 1976
3 Excerpts

MURTY, “Graph Theory with Applications,

  • U.S.R.J.A. BONDY
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…