Learn More
A graph G is called cycle Mengerian (CM) if for any nonnegative integral function w de ned on V (G), the maximum number of cycles in G such that each vertex v is used at most w(v) times is equal to(More)