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:
Mulvey, Irene (2001)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Josef Kaucký (1971)
Matematický časopis
Similarity:
Rakotondrajao, Fanja (2007)
Integers
Similarity:
Bernhardt, Chris (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ben Arous, Gérard, Cerf, Raphaël (1996)
Electronic Journal of Probability [electronic only]
Similarity:
Mulvey, Irene (2001)
International Journal of Mathematics and Mathematical Sciences
Similarity:
M.M.M. Jaradat (2008)
Discussiones Mathematicae Graph Theory
Similarity:
A construction of minimum cycle bases of the lexicographic product of graphs is presented. Moreover, the length of a longest cycle of a minimal cycle basis is determined.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kulikauskas, Andrius, Remme, Jeffrey (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parviainen, Robert (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pierre Michel (1975)
Publications mathématiques et informatique de Rennes
Similarity:
Jozef Bobok (2001)
Fundamenta Mathematicae
Similarity:
Let ℳ be the set of pairs (T,g) such that T ⊂ ℝ is compact, g: T → T is continuous, g is minimal on T and has a piecewise monotone extension to convT. Two pairs (T,g),(S,f) from ℳ are equivalent if the map h: orb(minT,g) → orb(minS,f) defined for each m ∈ ℕ₀ by is increasing on orb(minT,g). An equivalence class of this relation-a minimal (oriented) pattern A-is exhibited by a continuous interval map f:I → I if there is a set T ⊂ I such that (T,f|T) = (T,f) ∈ A. We define the forcing...