@article {Kezdy:February 1996:0097-3165:353,
	author = "Kezdy A.E.",
	author = "Snevily H.S.",
	author = "Wang C.",
	title = "Partitioning Permutations into Increasing and Decreasing Subsequences",
	journal = "Journal of Combinatorial Theory, Series A",
	volume = "73",
	year = "February 1996",
	abstract = "<P> A permutation is an ( r , s )- permutation if it can be partitioned into r increasing and s decreasing, possibly empty subsequences. For any fixed non-negative integers r and s , the family of ( r , s )-permutations is characterized by a finite list of forbidden subsequences. This is derived from a more general graph-theoretic proof showing that, for any fixed non-negative integers r and s , the family of perfect graphs whose vertex set admits a partition into r cliques and s independent sets if characterized by a finite list of forbidden induced subgraphs.</P>",
	pages = "353-359(7)",
	url = "http://www.ingentaconnect.com/content/ap/ta/1996/00000073/00000002/art00028"
}