{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:52Z","timestamp":1748404912747,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010426","name":"UGC-DAE Consortium for Scientific Research, University Grants Commission","doi-asserted-by":"publisher","award":["21\/12\/2014 (ii) EU-V"],"award-info":[{"award-number":["21\/12\/2014 (ii) EU-V"]}],"id":[{"id":"10.13039\/501100010426","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":[[2025,2]]},"DOI":"10.1007\/s00373-025-02887-9","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T14:27:58Z","timestamp":1737383278000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Some Subclasses of Oriented Catch Digraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Sanchita","family":"Paul","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,20]]},"reference":[{"key":"2887_CR1","volume-title":"Digraphs, Springer Monographs in Mathematics","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs, Springer Monographs in Mathematics. Springer, London (2009)"},{"key":"2887_CR2","unstructured":"Brown, D.E: Variations on interval graphs. University of Colorado at Denver (2004)"},{"issue":"6","key":"2887_CR3","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s00184-011-0351-y","volume":"75","author":"E Ceyhan","year":"2012","unstructured":"Ceyhan, E.: The distribution of the relative arc density of a family of interval catch digraph based on uniform data. Metrika 75(6), 761\u2013793 (2012)","journal-title":"Metrika"},{"issue":"4","key":"2887_CR4","first-page":"349","volume":"14","author":"E Ceyhan","year":"2016","unstructured":"Ceyhan, E.: Density of a random interval catch digraph family and its use for testing uniformity. REVSTAT Stat J 14(4), 349\u2013394 (2016)","journal-title":"REVSTAT Stat J"},{"issue":"2","key":"2887_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1080\/02331888.2020.1720020","volume":"54","author":"E Ceyhan","year":"2020","unstructured":"Ceyhan, E.: Domination number of an interval catch digraph family and its use for testing uniformity. Statistics 54(2), 310\u2013339 (2020)","journal-title":"Statistics"},{"issue":"1\u20133","key":"2887_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0166-218X(00)00309-7","volume":"112","author":"G Confessore","year":"2001","unstructured":"Confessore, G., Dell\u2019Olmo, P., Giordani, S.: An approximation result for a periodic allocation problem. Discrete Appl. Math. 112(1\u20133), 53\u201372 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2887_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.3190130206","volume":"13","author":"S Das","year":"1989","unstructured":"Das, S., Sen, M., Roy, A., West, D.B.: Interval digraphs: an analogue of interval graphs. J. Graph Theory 13(2), 189\u2013202 (1989)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2887_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(85)90042-1","volume":"55","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval graphs and interval orders. Discret. Math. 55(2), 135\u2013149 (1985)","journal-title":"Discret. Math."},{"key":"2887_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"PC Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16, 539\u2013548 (1964)","journal-title":"Can. J. Math."},{"key":"2887_CR10","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Annals of Disc. Math 57 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"2887_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs, vol. 89. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"2887_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/j.2044-8317.1974.tb00534.x","volume":"27","author":"L Hubert","year":"1974","unstructured":"Hubert, L.: Some applications of graph theory and related non-metric techniques to problems of approximate seriation: The case of symmetric proximity measures. Br. J. Math. Stat. Psychol. 27(2), 133\u2013153 (1974)","journal-title":"Br. J. Math. Stat. Psychol."},{"issue":"1","key":"2887_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkeikerker","year":"1962","unstructured":"Lekkeikerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundam. Math. 51(1), 45\u201364 (1962)","journal-title":"Fundam. Math."},{"issue":"18","key":"2887_CR14","doi-asserted-by":"publisher","first-page":"5618","DOI":"10.1016\/j.disc.2008.04.003","volume":"309","author":"MC Lin","year":"2009","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Characterizations and recognition of circular-arc graphs and subclasses: a survey. Discrete Math. 309(18), 5618\u20135635 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"2887_CR15","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/jgt.3190080312","volume":"8","author":"H Maehara","year":"1984","unstructured":"Maehara, H.: A digraph represented by a family of boxes or spheres. J. Graph Theory 8(3), 431\u2013439 (1984)","journal-title":"J. Graph Theory"},{"key":"2887_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00357-003-0003-7","volume":"20","author":"CE Priebe","year":"2003","unstructured":"Priebe, C.E., Marchette, D.J., DeVinney, J.G., Socolinsky, D.A.: Classification using class cover catch digraphs. J. Classif. 20, 3\u201323 (2003)","journal-title":"J. Classif."},{"key":"2887_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"RM McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica 37, 93\u2013147 (2003)","journal-title":"Algorithmica"},{"key":"2887_CR18","unstructured":"Nussbaum, Y.: Recognition of circular-arc graphs and some subclasses. M.Sc. Thesis, Tel Aviv University, School of Computer Science, Israel (2007)"},{"key":"2887_CR19","doi-asserted-by":"crossref","unstructured":"Paul, S., Ghosh, S.: On some subclasses of interval catch digraphs. Electron. J. Graph Theory Appl. 10(1) (2022)","DOI":"10.5614\/ejgta.2022.10.1.10"},{"key":"2887_CR20","doi-asserted-by":"crossref","unstructured":"Paul, S., Gupta, S., Ghosh, S.: On some subclasses of circular-arc catch digraphs (2022). arXiv:2010.08664 [math.CO]","DOI":"10.5614\/ejgta.2022.10.1.10"},{"issue":"3","key":"2887_CR21","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(89)90271-9","volume":"73","author":"E Prisner","year":"1989","unstructured":"Prisner, E.: A characterization of interval catch digraphs. Discrete Math. 73(3), 285\u2013289 (1989)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"2887_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0166-218X(94)90104-X","volume":"51","author":"E Prisner","year":"1994","unstructured":"Prisner, E.: Algorithms for interval catch digraphs. Discrete Appl. Math. 51(1\u20132), 147\u2013157 (1994)","journal-title":"Discrete Appl. Math."},{"key":"2887_CR23","volume-title":"Discrete Mathematical Models","author":"FS Roberts","year":"1976","unstructured":"Roberts, F.S.: Discrete Mathematical Models. Prentice-Hall, Upper Saddle River (1976)"},{"key":"2887_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970401","volume-title":"Graph Theory and Its Applications to Problems of Society","author":"FS Roberts","year":"1978","unstructured":"Roberts, F.S.: Graph Theory and Its Applications to Problems of Society. SIAM Publishing, Philadelphia (1978)"},{"issue":"5","key":"2887_CR25","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1002\/jgt.3190130508","volume":"13","author":"M Sen","year":"1989","unstructured":"Sen, M., Das, S., West, D.B.: Circular-arc digraphs: a characterization. J. Graph Theory 13(5), 581\u2013592 (1989)","journal-title":"J. Graph Theory"},{"issue":"S1","key":"2887_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jcp.1040700403","volume":"70","author":"FW Stahl","year":"1967","unstructured":"Stahl, F.W.: Circular genetic maps. J. Cell. Physiol. 70(S1), 1\u201312 (1967)","journal-title":"J. Cell. Physiol."},{"key":"2887_CR27","doi-asserted-by":"crossref","unstructured":"Stefanakos, S., Erlebach, T.: Routing in all-optical ring networks revisited. In: Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No. 04TH8769), vol. 1, pp. 288\u2013293. IEEE (2004)","DOI":"10.1109\/ISCC.2004.1358419"},{"issue":"3","key":"2887_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","volume":"2","author":"K Stoffers","year":"1968","unstructured":"Stoffers, K.: Scheduling of traffic lights-a new approach. Transp. Res. 2(3), 199\u2013234 (1968)","journal-title":"Transp. Res."},{"issue":"2","key":"2887_CR29","doi-asserted-by":"publisher","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","volume":"39","author":"A Tucker","year":"1971","unstructured":"Tucker, A.: Matrix characterizations of circular-arc graphs. Pac. J. Math. 39(2), 535\u2013545 (1971)","journal-title":"Pac. J. Math."},{"issue":"2","key":"2887_CR30","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","volume":"12","author":"A Tucker","year":"1972","unstructured":"Tucker, A.: A structure theorem for the consecutive 1\u2019s property. J. Comb. Theory Ser. B 12(2), 153\u2013162 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20132","key":"2887_CR31","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"A Tucker","year":"1974","unstructured":"Tucker, A.: Structure theorems for some circular-arc graphs. Discrete Math. 7(1\u20132), 167\u2013195 (1974)","journal-title":"Discrete Math."},{"issue":"1","key":"2887_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A Tucker","year":"1980","unstructured":"Tucker, A.: An efficient test for circular-arc graphs. SIAM J. Comput. 9(1), 1\u201324 (1980)","journal-title":"SIAM J. Comput."},{"key":"2887_CR33","doi-asserted-by":"crossref","unstructured":"Tucker, A.: Circular arc graphs: new uses and a new algorithm. In: Theory and Applications of Graphs: Proceedings. Michigan May 11\u201315, 1976, pp. 580\u2013589. Springer, Berlin (2006)","DOI":"10.1007\/BFb0070412"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02887-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02887-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02887-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:39Z","timestamp":1748319759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02887-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2887"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02887-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"6 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"23"}}