Letter graphs and geometric grid classes of permutations: characterization and recognition
Combinatorics
2018-05-01 v1 Discrete Mathematics
Abstract
In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive way, a polynomial-time recognition of geometric grid classes of permutations and -letter graphs for a fixed . However, constructive algorithms are available only for . In this paper, we present the first constructive polynomial-time algorithm for the recognition of -letter graphs. It is based on a structural characterization of graphs in this class.
Cite
@article{arxiv.1804.11217,
title = {Letter graphs and geometric grid classes of permutations: characterization and recognition},
author = {Bogdan Alecu and Vadim Lozin and Dominique de Werra and Viktor Zamaraev},
journal= {arXiv preprint arXiv:1804.11217},
year = {2018}
}
Comments
arXiv admin note: text overlap with arXiv:1108.6319 by other authors