Well-quasi-order for permutation graphs omitting a path and a clique
From MaRDI portal
Publication:2344822
zbMath1312.05114arXiv1312.5907MaRDI QIDQ2344822
Robert Brignall, Vadim V. Lozin, Vincent R. Vatter, Nicholas Korpelainen, Aistis Atminas
Publication date: 18 May 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5907
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Well-quasi-ordering versus clique-width, On well quasi-order of graph classes under homomorphic image orderings, Recent Progress on Well-Quasi-ordering Graphs
Cites Work
- Unnamed Item
- On partial well-order for monotone grid classes of permutations
- Grid classes and partial well order
- Labelled induced subgraphs and well-quasi-ordering
- Graph minors. I. Excluding a forest
- Profile classes and partial well-order for permutations
- Generating and enumerating 321-avoiding and skew-merged simple permutations
- Two forbidden induced subgraphs and well-quasi-ordering
- Inflations of geometric grid classes of permutations
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Simple permutations and pattern restricted permutations
- Geometric grid classes of permutations
- Bipartite induced subgraphs and well-quasi-ordering
- Subclasses of the separable permutations
- Small permutation classes
- Subgraphs and well‐quasi‐ordering
- Transitiv orientierbare Graphen
- Ordering by Divisibility in Abstract Algebras