## For every graph with no bridge, there is a list of cycles so that every edge is contained in exactly two. |

## Home |

## What's known |

## Stronger conjectures |

## Concepts |

This conjecture implies the

This is a strengthening of the

The

From the link above we obtain a proof that this concjecture implies the

Most of the conjectures named at this website are related to the Berge-Fulkerson conjecture. For example, this conjecture can be stated in a similar way as the