{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:31:48Z","timestamp":1648596708264},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1007\/s11083-004-8796-5","type":"journal-article","created":{"date-parts":[[2005,9,2]],"date-time":"2005-09-02T08:11:03Z","timestamp":1125648663000},"page":"131-135","source":"Crossref","is-referenced-by-count":0,"title":["The Numbers of Shared Upper Bounds Determine a Poset"],"prefix":"10.1007","volume":"21","author":[{"given":"Miranca","family":"Fischermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Knoben","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Kremer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,18]]},"reference":[{"key":"5278796_CR1","first-page":"185","volume":"66","author":"D. J. Bergstrand","year":"1988","unstructured":"Bergstrand, D. J. and Jones, K. F.: On upper bound graphs of partially ordered sets, Congr. Numer. 66 (1988), 185\u2013194.","journal-title":"Congr. Numer."},{"key":"5278796_CR2","first-page":"109","volume":"28","author":"D. J. Bergstrand","year":"1989","unstructured":"Bergstrand, D. J. and Jones, K. F.: Graphs that are both the upper and lower bound graphs of a poset, Ars Combin. 28 (1989), 109\u2013121.","journal-title":"Ars Combin."},{"key":"5278796_CR3","unstructured":"Bondy, J. A.: Basic graph theory: Paths and circuits, in R. L. Graham et al. (eds), Handbook of Combinatorics, Vol. 1, Elsevier (North-Holland), 1995, pp. 3\u2013110."},{"key":"5278796_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0012-365X(97)00048-4","volume":"179","author":"H. Era","year":"1998","unstructured":"Era, H. and Tsuchiya, M.: On upper bound graphs whose complements are also upper bound graphs, Discrete Math. 179 (1998), 103\u2013109.","journal-title":"Discrete Math."},{"key":"5278796_CR5","series-title":"SIAM Monographs on Discrete Mathematics and Applications","volume-title":"Topics in Intersection Graph Theory","author":"F. R. McKee T. A. and McMorris","year":"1999","unstructured":"McKee T. A. and McMorris, F. R.: Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, Soc. Industrial Appl. Math., Philadelphia, 1999."},{"key":"5278796_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0012-365X(83)90199-1","volume":"44","author":"F. R. McMorris","year":"1983","unstructured":"McMorris, F. R. and Myers, G. T.: Some uniqueness results for upper bound graphs, Discrete Math. 44 (1983), 321\u2013324.","journal-title":"Discrete Math."},{"key":"5278796_CR7","first-page":"134","volume":"7","author":"F. R. McMorris","year":"1982","unstructured":"McMorris, F. R. and Zaslavsky, T.: Bound graphs of a partially ordered set, J. Combin. Inform. System Sci. 7 (1982), 134\u2013138.","journal-title":"J. Combin. Inform. System Sci."},{"key":"5278796_CR8","unstructured":"Trotter, W. T.: Partially ordered sets, in R. L. Graham et al. (eds), Handbook of Combinatorics, Vol. 1, Elsevier (North-Holland), 1995, pp. 433\u2013480."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-004-8796-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-004-8796-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-004-8796-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:12:10Z","timestamp":1559365930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-004-8796-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["5278796"],"URL":"https:\/\/doi.org\/10.1007\/s11083-004-8796-5","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}