The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

Edge-disjoint odd cycles in graphs with small chromatic number

Claude BergeBruce Reed — 1999

Annales de l'institut Fourier

For a simple graph, we consider the minimum number of edges which block all the odd cycles and the maximum number of odd cycles which are pairwise edge-disjoint. When these two coefficients are equal, interesting consequences appear. Similar problems (but interchanging “ odd cycles” and “ odd cycles”) have been considered in a paper by Berge and Fouquet.

Page 1

Download Results (CSV)