{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:08:04Z","timestamp":1750856884344},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0012-365x(84)90035-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"63-70","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Almost all comparability graphs are UPO"],"prefix":"10.1016","volume":"50","author":[{"given":"Rolf H.","family":"M\u00f6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0012-365X(84)90035-9_BIB1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1112\/jlms\/s2-3.2.260","article-title":"Uniquely partially orderable graphs","volume":"3","author":"Aigner","year":"1971","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(84)90035-9_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1112\/jlms\/s2-21.1.31","article-title":"The dimension of finite and infinite comparability graphs","volume":"21","author":"Arditti","year":"1980","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(84)90035-9_BIB3","article-title":"Lattice Theory","volume":"Vol. XXV","author":"Birkhoff","year":"1973"},{"key":"10.1016\/0012-365X(84)90035-9_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190030305","article-title":"Properties of almost all graphs and complexes","volume":"3","author":"Blass","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(84)90035-9_BIB5","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0012-365X(84)90035-9_BIB6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0012-365X(84)90035-9_BIB7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/0012-365X(84)90035-9_BIB8"},{"key":"10.1016\/0012-365X(84)90035-9_BIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","article-title":"Asymptotic enumeration of partial orders on a finite set","volume":"205","author":"Kleitman","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(84)90035-9_BIB10","first-page":"33","article-title":"On the distribution of locally undecomposable relations and independence systems","volume":"42","author":"M\u00f6hring","year":"1981","journal-title":"Methods Oper. Res."},{"key":"10.1016\/0012-365X(84)90035-9_BIB11","series-title":"Mathematische Systeme in der \u00d6komonie","first-page":"415","article-title":"Dimension, reversibility and chain-equivalence of posets, and connections with homomorphisms","author":"M\u00f6hring","year":"1983"},{"key":"10.1016\/0012-365X(84)90035-9_BIB12","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring and F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discrete Math., to appear.","DOI":"10.1016\/S0304-0208(08)72966-9"},{"key":"10.1016\/0012-365X(84)90035-9_BIB13","series-title":"paper presented at the Oberwolfach workshop \u2018Kombinatorik geordneter Mengen\u2019","article-title":"Properties of almost all parametric relations","author":"Oberschelp","year":"1980"},{"key":"10.1016\/0012-365X(84)90035-9_BIB14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01210984","article-title":"Graph derivations","volume":"76","author":"Sabidussi","year":"1961","journal-title":"Math. Z."},{"key":"10.1016\/0012-365X(84)90035-9_BIB15","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF00967091","article-title":"Partially ordered sets and their comparability graphs","volume":"11","author":"Shevrin","year":"1970","journal-title":"Siberian Math. J."},{"key":"10.1016\/0012-365X(84)90035-9_BIB16","first-page":"35","article-title":"The dimension of a comparability graph","volume":"60","author":"Trotter","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84900359?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84900359?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:51:07Z","timestamp":1553165467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X84900359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":16,"alternative-id":["0012365X84900359"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(84)90035-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1984]]}}}