{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:07:23Z","timestamp":1648753643160},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5130,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0012-365x(99)00022-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"97-117","source":"Crossref","is-referenced-by-count":4,"title":["Enumerative aspects of certain subclasses of perfect graphs"],"prefix":"10.1016","volume":"205","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00022-9_BIB1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01788543","article-title":"Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials","volume":"3","author":"Beissinger","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB2","unstructured":"V. Chvatal, P.L. Hammer, Set packing and threshold graphs, Univ. Waterloo Res. Report, 1973."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB3","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB4","unstructured":"S. Foldes, P.L. Hammer, Split graphs, Proceedings of the eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, LA, 1977."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB6","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"10.1016\/S0012-365X(99)00022-9_BIB7","doi-asserted-by":"crossref","unstructured":"F. Harary, E.M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.","DOI":"10.1016\/B978-0-12-324245-7.50005-8"},{"key":"10.1016\/S0012-365X(99)00022-9_BIB8","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading. MA, 1979."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB9","doi-asserted-by":"crossref","first-page":"709","DOI":"10.2140\/pjm.1970.34.709","article-title":"Permutations, matrices and generalized Young tableaux","volume":"34","author":"Knuth","year":"1970","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB10","unstructured":"D.E. Knuth, Sorting and Searching (The Art of Computer Programming, vol. 3), Addison-Wesley, Reading. MA, 1973."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB11","unstructured":"D.E. Knuth, Fundamental Algorithms (The Art of Computer Programming, vol. 1), Narosa Publishing House, New Delhi, 1985."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB12","unstructured":"V. Krishnamurthy, Combinatorics \u2014 Theory and Applications, East-West Press, New Delhi, 1985."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB13","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lovasz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB14","unstructured":"N.V.R. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Elsevier, Amsterdam 1995 (Ann. Discrete Math. 56)."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0166-218X(94)00061-H","article-title":"Enumeration of difference graphs","volume":"60","author":"Peled","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB16","doi-asserted-by":"crossref","unstructured":"D. Rogers, L. Shapiro, Some correspondence involving the Schr\u00f6der numbers and relations, in Combinatorial Mathematics, Proceedings of the International Conference, Canberra, Lecture Notes in Mathematics, vol. 686, Springer, Berlin, 1978, pp. 267\u2013276.","DOI":"10.1007\/BFb0062541"},{"key":"10.1016\/S0012-365X(99)00022-9_BIB17","doi-asserted-by":"crossref","unstructured":"D. Rogers, L. Shapiro, Deques, trees and lattice paths, in: Combinatorial Mathematics, vol. VIII, Lecture Notes in Mathematics, vol. 884, Springer, Berlin, 1981, pp 293\u2013303.","DOI":"10.1007\/BFb0091826"},{"key":"10.1016\/S0012-365X(99)00022-9_BIB18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","article-title":"Longest increasing and decreasing subsequences","volume":"13","author":"Schensted","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB19","first-page":"361","article-title":"Vier Combinatorische Probleme","volume":"15","author":"Schr\u00f6der","year":"1870","journal-title":"Z Mathematik Physik"},{"key":"10.1016\/S0012-365X(99)00022-9_BIB20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0404025","article-title":"Bootstrap percolation, the Schr\u00f6der numbers and the n-kings problem","volume":"4","author":"Shapiro","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(99)00022-9_BIB21","first-page":"17","article-title":"A note on \u2018The comparability graph of a tree\u2019","volume":"16","author":"Wolk","year":"1965","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T11:49:53Z","timestamp":1579002593000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99000229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0012365X99000229"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00022-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}