{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:13:51Z","timestamp":1648811631523},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"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":[[1991,7]]},"DOI":"10.1016\/0012-365x(91)90358-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"213-214","source":"Crossref","is-referenced-by-count":0,"title":["Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4-chains"],"prefix":"10.1016","volume":"90","author":[{"given":"Hazel","family":"Perfect","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90358-9_BIB1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(73)90001-4","article-title":"Lexicographic matching in Boolean algebras","volume":"14","author":"Aigner","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(91)90358-9_BIB2","first-page":"65","volume":"4","author":"Griggs","year":"1987","journal-title":"Partitioning Boolean lattices into chains of subsets"},{"key":"10.1016\/0012-365X(91)90358-9_BIB3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0012-365X(88)90204-X","article-title":"Problems on chain partitions","volume":"72","author":"Griggs","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90358-9_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01142579","article-title":"Choice mappings of certain classes of finite sets","volume":"124","author":"Lewin","year":"1972","journal-title":"Math. Z."},{"key":"10.1016\/0012-365X(91)90358-9_BIB5","article-title":"An application of bipartite matching to chain partitions of sets","author":"Miley","year":"1986","journal-title":"Master's Thesis Univ. of South Carolina"},{"key":"10.1016\/0012-365X(91)90358-9_BIB6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0097-3165(77)90034-6","article-title":"Recursive matching algorithms and linear orders on the subset lattice","volume":"23","author":"White","year":"1977","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91903589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91903589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:58:17Z","timestamp":1555120697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X91903589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["0012365X91903589"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90358-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}