Generalized Coloring of Permutations
From MaRDI portal
Publication:5009614
DOI10.4230/LIPIcs.ESA.2018.50OpenAlexW2888882694MaRDI QIDQ5009614
Vít Jelínek, Michal Opler, Pavel Valtr
Publication date: 4 August 2021
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9513/pdf/LIPIcs-ESA-2018-50.pdf/
Related Items (1)
Cites Work
- Pattern matching for permutations
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Splittings and Ramsey properties of permutation classes
- The existence of uniquely \(-G\) colourable graphs
- Staircases, dominoes, and the growth rate of 1324-avoiders
- Computational aspects of greedy partitioning of graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Partitioning permutations into increasing and decreasing subsequences
- The complexity of generalized graph colorings
- Polar permutation graphs are polynomial-time recognisable
- On the growth of merges and staircases of permutation classes
- A new record for \(1324\)-avoiding permutations
- Unsplittable classes of separable permutations
- An Erd\H{o}s--Hajnal analogue for permutation classes
- A New Upper Bound for 1324-Avoiding Permutations
- On Complexity of the Subpattern Problem
- Splittability and 1-amalgamability of permutation classes
- Finding small patterns in permutations in linear time
- On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized Coloring of Permutations
