Reconstructing permutations from cycle minors.
Monks, Maria (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Monks, Maria (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Benjamin, Arthur T., Gaebler, David, Gaebler, Robert (2003)
Integers
Similarity:
Bóna, Miklós (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Lugo, Michael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rakotondrajao, Fanja (2007)
Integers
Similarity:
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gary Mullen (1976)
Acta Arithmetica
Similarity:
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity:
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.
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
Karol Borsuk (1952)
Fundamenta Mathematicae
Similarity: