{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:23:22Z","timestamp":1778577802103,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":7990,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0097-3165(91)90083-s","type":"journal-article","created":{"date-parts":[[2004,8,27]],"date-time":"2004-08-27T22:52:48Z","timestamp":1093647168000},"page":"158-164","source":"Crossref","is-referenced-by-count":33,"title":["Fibres and ordered set coloring"],"prefix":"10.1016","volume":"58","author":[{"given":"Dwight","family":"Duffus","sequence":"first","affiliation":[]},{"given":"H.A.","family":"Kierstead","sequence":"additional","affiliation":[]},{"given":"W.T.","family":"Trotter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(91)90083-S_BIB1","series-title":"Vertex sets that meet all maximal cliques of a graph","author":"Aigner","year":"1986"},{"key":"10.1016\/0097-3165(91)90083-S_BIB2","doi-asserted-by":"crossref","unstructured":"D. Duffus, B. Sands, and P. Winkler, Maximal chains and antichains in Boolean lattices, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/0403017"},{"key":"10.1016\/0097-3165(91)90083-S_BIB3","unstructured":"D. Dufrus, B. Sands, N. Sauer, and R. Woodrow, Two-colouring all maximal two-element antichains, J. Combin. Theory Ser. A, to appear."},{"key":"10.1016\/0097-3165(91)90083-S_BIB4","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0097-3165(91)90083-S_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0012-365X(87)90009-4","article-title":"A Ramsey theoretic problem for finite ordered sets","volume":"63","author":"Kierstead","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(91)90083-S_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0097-3165(87)90029-X","article-title":"Chains, antichains, and fibres","volume":"44","author":"Long","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0097-3165(91)90083-S_BIB7","series-title":"Stacking posets for a higher fibre-size to poset-size ratio","author":"Maltby","year":"1989"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731659190083S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731659190083S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T07:26:01Z","timestamp":1549265161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731659190083S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["009731659190083S"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(91)90083-s","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}