Théorie générale des jeux à personnes
Sur une convexité régulière non linéaire et ses applications à la théorie des jeux
Le problème du gain dans la théorie généralisée des jeux sans informations
Edge-disjoint odd cycles in graphs with small chromatic number
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