Letter graphs and geometric grid classes of permutations: characterization and recognition

DOI10.1016/j.dam.2020.01.038zbMath1442.05219arXiv1804.11217OpenAlexW2963998142MaRDI QIDQ5918890

Bogdan Alecu, Vadim V. Lozin, Victor Zamaraev, Dominique de Werra

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.11217

zbMATH Keywords

permutationsgeometric grid classesletter graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The micro-world of cographs ⋮ Letter Graphs and Geometric Grid Classes of Permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ Letter graphs and modular decomposition ⋮ Hereditary classes of graphs: a parametric approach ⋮ Tree Pivot-Minors and Linear Rank-Width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics on traces
• On ordered graphs and graph orderings
• Letter graphs and well-quasi-order by induced subgraphs
• Algorithmic meta-theorems for restrictions of treewidth
• Threshold graphs and related topics
• Two forbidden induced subgraphs and well-quasi-ordering
• Geometric grid classes of permutations
• Clique-Width is NP-Complete
• Finding a Minimum Circuit in a Graph
• On Universal Threshold Graphs
• Induced subgraphs and well‐quasi‐ordering
• Restricted permutations

This page was built for publication: Letter graphs and geometric grid classes of permutations: characterization and recognition