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

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

Displaying similar documents to “Rational and homological equivalence for real cycles.”

Disjoint 5-cycles in a graph

Hong Wang (2012)

Discussiones Mathematicae Graph Theory

Similarity:

We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.