Partitioning permutations into increasing and decreasing subsequences

DOI10.1016/S0097-3165(96)80012-4zbMath0844.05003OpenAlexW4238347363MaRDI QIDQ1906146

Chi Wang, André E. Kézdy, Hunter S. Snevily

Publication date: 26 February 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0097-3165(96)80012-4

zbMATH Keywords

partitionpermutationperfect graphsforbidden induced subgraphscocoloringforbidden subsequence characterization

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph theory (05C99)

Related Items (15)

Satgraphs and independent domination. I ⋮ Partitioning permutations into monotone subsequences ⋮ Unsplittable classes of separable permutations ⋮ A Brooks‐Type Theorem for the Bichromatic Number ⋮ Sorting with networks of data structures ⋮ Generalized split graphs and Ramsey numbers ⋮ On compressing permutations and adaptive sorting ⋮ Generalized Coloring of Permutations ⋮ A tutorial on the use of graph coloring for some problems in robotics ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ Restricted permutations ⋮ Partitioning graphs into complete and empty graphs ⋮ Partitioning cographs into cliques and stable sets ⋮ Growth rates of permutation grid classes, tours on graphs, and the spectral radius ⋮ \((p,k)\)-coloring problems in line graphs

Cites Work

• Some topics in cochromatic theory
• Forbidden subsequences
• Chromatic number versus chromatic number in graphs with bounded clique number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning permutations into increasing and decreasing subsequences