{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:30:16Z","timestamp":1779229816493,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,4,1]],"date-time":"1978-04-01T00:00:00Z","timestamp":260236800000},"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":12891,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1978,4]]},"DOI":"10.1016\/0095-8956(78)90013-8","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:32:55Z","timestamp":1094653975000},"page":"125-133","source":"Crossref","is-referenced-by-count":164,"title":["On a class of posets and the corresponding comparability graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"H.A","family":"Jung","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(78)90013-8_BIB1","series-title":"Combinatorial Theory and Its Applications","first-page":"41","article-title":"Hamilton circuits in the comparability graph of a tree","author":"Arditti","year":"1969"},{"key":"10.1016\/0095-8956(78)90013-8_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(78)90013-8_BIB3","article-title":"Verallgemeinerung eines graphentheoretischen Satzes von Redei","volume":"21","author":"Gallai","year":"1960","journal-title":"Acta Sci. Math. Szeged"},{"key":"10.1016\/0095-8956(78)90013-8_BIB4","first-page":"1370","article-title":"Caract\u00e9risation des graphes non orientes dont on peut orienter les ar\u00e8tes de maniere a obtenir le graphe d'une relation d'ordre","volume":"254","author":"Ghouila-Houri","year":"1962","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/0095-8956(78)90013-8_BIB5","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."},{"key":"10.1016\/0095-8956(78)90013-8_BIB6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.4064\/fm-63-2-217-219","article-title":"Wolk \u00fcber die Vergleichbarkeitsgrapher von ordnungstheoretischen B\u00e4umen","volume":"63","author":"Jung","year":"1968","journal-title":"Fund. Math."},{"key":"10.1016\/0095-8956(78)90013-8_BIB7","series-title":"Proceedings of the Second Czechoslovakian Symposium on Graph Theory","article-title":"Note on Hamiltonian graphs","author":"Jung","year":"1974"},{"key":"10.1016\/0095-8956(78)90013-8_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.4064\/cm-30-2-295-316","article-title":"Hamiltonian circuits and path coverings of vertices in graphs","volume":"30","author":"Skupien","year":"1974","journal-title":"Colloq. Math."},{"key":"10.1016\/0095-8956(78)90013-8_BIB9","series-title":"Proceedings of the Second Czechoslovakian Symposium on Graph Theory","article-title":"Path partitions of vertices and hamiltonity of graphs","author":"Skupien","year":"1974"},{"key":"10.1016\/0095-8956(78)90013-8_BIB10","first-page":"789","article-title":"The comparability graph of a tree","volume":"13","author":"Wolk","year":"1962"},{"key":"10.1016\/0095-8956(78)90013-8_BIB11","first-page":"17","article-title":"A note on The comparability graph of a tree","volume":"16","author":"Wolk","year":"1965"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T03:20:34Z","timestamp":1549250434000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895678900138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,4]]}},"alternative-id":["0095895678900138"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(78)90013-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1978,4]]}}}