Displaying similar documents to “Reconstructing permutations from cycle minors.”

On Hultman numbers.

Doignon, Jean-Paul, Labarre, Anthony (2007)

Journal of Integer Sequences [electronic only]

Similarity:

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.