{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:27Z","timestamp":1740123807621,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T00:00:00Z","timestamp":1598054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T00:00:00Z","timestamp":1598054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11083-020-09536-1","type":"journal-article","created":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T05:02:33Z","timestamp":1598072553000},"page":"229-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On k-tree Containment Graphs of Paths in a Tree"],"prefix":"10.1007","volume":"38","author":[{"given":"Liliana","family":"Alc\u00f3n","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5740-6632","authenticated-orcid":false,"given":"Noem\u00ed","family":"Gudi\u00f1o","sequence":"additional","affiliation":[]},{"given":"Marisa","family":"Gutierrez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,22]]},"reference":[{"key":"9536_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.endm.2015.07.030","volume":"50","author":"L Alc\u00f3n","year":"2015","unstructured":"Alc\u00f3n, L., Gudi\u00f1o, N., Gutierrez, M.: On containment graphs of paths in a tree. Electron. Notes Discret. Math. 50, 175\u2013180 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"9536_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.dam.2018.04.009","volume":"245","author":"L Alc\u00f3n","year":"2018","unstructured":"Alc\u00f3n, L., Gudi\u00f1o, N., Gutierrez, M.: Recent results on containment graphs of paths in a tree. Discret. Appl. Math. 245, 139\u2013147 (2018)","journal-title":"Discret. Appl. Math."},{"key":"9536_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V., Spinrad, J.: Graph Classes: a Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"9536_CR4","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.: Partially ordered sets. Am. J. Math. 63, 600\u2013610 (1941)","journal-title":"Am. J. Math."},{"key":"9536_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1006110326269","volume":"15","author":"PC Fishburn","year":"1999","unstructured":"Fishburn, P.C., Trotter, W.T.: Geometric containment orders: a survey. Order 15, 167\u2013182 (1999)","journal-title":"Order"},{"key":"9536_CR6","first-page":"25","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Mathematica Hungarica 18, 25\u201366 (1967)","journal-title":"Acta Mathematica Hungarica"},{"key":"9536_CR7","first-page":"1370","volume":"254","author":"A Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri, A.: Caract\u00e9rization des graphes non orient\u00e9s dont on peut orienter les arrtes de mani\u00e9re \u00e1 obtenir le graphe d\u2019une relation d\u2019ordre. C.R. Acad. Sci. Paris 254, 1370\u20131371 (1962)","journal-title":"C.R. Acad. Sci. Paris"},{"key":"9536_CR8","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1111\/j.1749-6632.1989.tb22452.x","volume":"555","author":"MC Golumbic","year":"1989","unstructured":"Golumbic, M.C., Scheinerman, E., Graphs, Containment: Posets, and related classes of graphs. Ann. N. Y. Acad. Sci 555, 192\u2013204 (1989)","journal-title":"Ann. N. Y. Acad. Sci"},{"key":"9536_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.4153\/CJM-1977-040-3","volume":"29","author":"D Kelly","year":"1977","unstructured":"Kelly, D.: The 3-irreducible partially ordered sets. Can. J. Math. 29, 367\u2013383 (1977)","journal-title":"Can. J. Math."},{"key":"9536_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF00814403","volume":"9","author":"HA Kierstead","year":"1992","unstructured":"Kierstead, H.A., Trotter, W.T.: The dimension of cycle-free orders. Order 9, 103\u2013110 (1992)","journal-title":"Order"},{"key":"9536_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF00385814","volume":"8","author":"T Ma","year":"1991","unstructured":"Ma, T., Spinrad, J.P.: Cycle-free partial orders and chordal comparability graphs. Order 8, 49\u201361 (1991)","journal-title":"Order"},{"key":"9536_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"DJ Rose","year":"1974","unstructured":"Rose, D.J.: On simple characterizations of k-trees. Discret. Math. 7, 317\u2013322 (1974)","journal-title":"Discret. Math."},{"key":"9536_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"9536_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0012-365X(76)80011-8","volume":"16","author":"WT Trotter","year":"1976","unstructured":"Trotter, W.T., Moore, J.I.: Characterization problems for graphs, partially ordered sets, lattices and families of sets. Discret. Math. 16, 361\u2013381 (1976)","journal-title":"Discret. Math."},{"key":"9536_CR15","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"JP Spinrad","year":"1985","unstructured":"Spinrad, J.P.: On comparability and permutation graphs. SIAM J. Comput. 14, 658\u2013670 (1985)","journal-title":"SIAM J. Comput."},{"key":"9536_CR16","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Partial orders and euclidean geometry. In: Rival, I. (ed.) Algorithms and Order, pp 327\u2013346. Kluwer Academic, Dordrecht (1989)","DOI":"10.1007\/978-94-009-2639-4_11"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-020-09536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11083-020-09536-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-020-09536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T23:22:51Z","timestamp":1629588171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11083-020-09536-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,22]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9536"],"URL":"https:\/\/doi.org\/10.1007\/s11083-020-09536-1","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2020,8,22]]},"assertion":[{"value":"18 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}