scientific article; zbMATH DE number 7283875

zbMath1453.05003MaRDI QIDQ5139687

Adam Mammoliti, R. Jamie Simpson

Publication date: 10 December 2020

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p011.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\((s, k)\)-clashclash-free permutationscyclic matching sequencibility

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (1)

Permutations that separate close elements

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum Manhattan distance and minimum jump of permutations
• The \(r\)-matching sequencibility of complete graphs
• Prolific permutations and permuted packings: downsets containing many large patterns
• Cyclic Matching Sequencibility of Graphs
• The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs

This page was built for publication: