Pattern avoidance in partial permutations (extended abstract)

Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev

Open source

DOI
10.46298/dmtcs.2818
Published
2010-01-01
Container
Discrete Mathematics and Theoretical Computer Science
Publisher
Discrete Mathematics and Theoretical Computer Science
Open access
yes

Credibility signals

uncertain Score 51/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/dmtcs.2818,
  title = {Pattern avoidance in partial permutations (extended abstract)},
  author = {Anders Claesson and Vít Jelínek and Eva Jelínková and Sergey Kitaev},
  year = {2010},
  journal = {Discrete Mathematics and Theoretical Computer Science},
  doi = {10.46298/dmtcs.2818},
  url = {https://doi.org/10.46298/dmtcs.2818}
}

RIS

TY  - JOUR
TI  - Pattern avoidance in partial permutations (extended abstract)
AU  - Anders Claesson
AU  - Vít Jelínek
AU  - Eva Jelínková
AU  - Sergey Kitaev
PY  - 2010
JO  - Discrete Mathematics and Theoretical Computer Science
DO  - 10.46298/dmtcs.2818
UR  - https://doi.org/10.46298/dmtcs.2818
ER  - 

APA

Claesson, A., Jelínek, V., Jelínková, E., & Kitaev, S. (2010). Pattern avoidance in partial permutations (extended abstract). Discrete Mathematics and Theoretical Computer Science. https://doi.org/10.46298/dmtcs.2818

Source records