{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:25Z","timestamp":1740107125095,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["34375-57400"],"award-info":[{"award-number":["34375-57400"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00373-024-02778-5","type":"journal-article","created":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T10:22:15Z","timestamp":1713349335000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semi-strict Chordality of Digraphs"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-2271","authenticated-orcid":false,"given":"Jing","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying Ying","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,17]]},"reference":[{"key":"2778_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1002\/jgt.3190140310","volume":"14","author":"J Bang-Jensen","year":"1990","unstructured":"Bang-Jensen, J.: Locally semicomplete digraphs: a generalization of tournaments. J. Graph Theory 14, 371\u2013390 (1990)","journal-title":"J. Graph Theory"},{"key":"2778_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/jgt.3190200205","volume":"20","author":"J Bang-Jensen","year":"1995","unstructured":"Bang-Jensen, J., Huang, J.: Quasi-transitive digraphs. J. Graph Theory 20, 141\u2013161 (1995)","journal-title":"J. Graph Theory"},{"key":"2778_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hung. 18, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"2778_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory B 16, 47\u201356 (1974)","journal-title":"J. Comb. Theory B"},{"key":"2778_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"2778_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/0202018","volume":"2","author":"L Haskins","year":"1973","unstructured":"Haskins, L., Rose, D.J.: Toward characterization of perfect elimination digraphs. SIAM J. Comput. 2, 217\u2013224 (1973)","journal-title":"SIAM J. Comput."},{"key":"2778_CR7","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.dam.2016.02.009","volume":"216","author":"P Hell","year":"2017","unstructured":"Hell, P., Hern\u00e1ndez-Cruz, C.: Strict chordal and strict split digraphs. Discrete Appl. Math. 216, 609\u2013617 (2017)","journal-title":"Discrete Appl. Math."},{"key":"2778_CR8","doi-asserted-by":"publisher","first-page":"112362","DOI":"10.1016\/j.disc.2021.112362","volume":"344","author":"J Huang","year":"2021","unstructured":"Huang, J., Ye, Y.Y.: Chordality of locally semicomplete and weakly quasi-transitive digraphs. Discrete Math. 344, 112362 (2021)","journal-title":"Discrete Math."},{"key":"2778_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0203022","volume":"3","author":"DJ Kleitman","year":"1974","unstructured":"Kleitman, D.J.: A note on perfect elimination digraphs. SIAM J. Comput. 3, 280\u2013282 (1974)","journal-title":"SIAM J. Comput."},{"key":"2778_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.dam.2018.03.061","volume":"247","author":"TA McKee","year":"2018","unstructured":"McKee, T.A.: Strict chordal digraphs viewed as graphs with distinguished edges. Discrete Appl. Math. 247, 122\u2013126 (2018)","journal-title":"Discrete Appl. Math."},{"key":"2778_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2012.06.019","volume":"463","author":"D Meister","year":"2012","unstructured":"Meister, D., Telle, J.A.: Chordal digraphs. Theoret. Comput. Sci. 463, 73\u201383 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"2778_CR12","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.S.: Algorithmic aspects of vertex elimination on graph. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"2778_CR13","unstructured":"Ye, Y.Y.: On Chordal Digraphs and Semi-Strict Chordal Digraphs. Master thesis, University of Victoria, (2019)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02778-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02778-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02778-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:04:26Z","timestamp":1721707466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02778-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,17]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2778"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02778-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,4,17]]},"assertion":[{"value":"19 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"They also declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"56"}}