{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T01:52:17Z","timestamp":1775785937146,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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-024-02865-7","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T17:39:20Z","timestamp":1735321160000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secant edges: a tool for Cohen et al.\u2019s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number"],"prefix":"10.1007","volume":"41","author":[{"given":"Darine","family":"Al-Mniny","sequence":"first","affiliation":[]},{"given":"Salman","family":"Ghazal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"issue":"8","key":"2865_CR1","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.disc.2013.01.011","volume":"313","author":"L Addario-Berry","year":"2013","unstructured":"Addario-Berry, L., Havet, F., Sales, C.L., Reed, B.A., Thomass\u00e9, S.: Oriented trees in digraphs. Discrete Math. 313(8), 967\u2013974 (2013)","journal-title":"Discrete Math."},{"issue":"4","key":"2865_CR2","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.jctb.2006.10.001","volume":"97","author":"L Addario-Berry","year":"2007","unstructured":"Addario-Berry, L., Havet, F., Thomass\u00e9, S.: Paths with two blocks in $$n$$-chromatic digraphs. J. Comb. Theory Ser. B 97(4), 620\u2013626 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2865_CR3","unstructured":"Al-Mniny, D.: On bispindles $$B(k_1,k_2;1)$$ in strongly connected digraphs with high chromatic number. Australas. J. Combin. 90 (2), 94\u2013109 (2024)"},{"key":"2865_CR4","unstructured":"Al-Mniny, D., Ghazal, S.: Remarks on the subdivisions of bispindles and two-blocks cycles in highly chromatic digraphs. arXiv:2010.10787v1"},{"issue":"2","key":"2865_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1112\/jlms\/s2-14.2.277","volume":"14","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A.: Disconnected orientations and a conjecture of Las Vergnas. J. Lond. Math. Soc. 14(2), 277\u2013282 (1976)","journal-title":"J. Lond. Math. Soc."},{"key":"2865_CR6","unstructured":"Burr, S.A.: Subtrees of directed graphs and hypergraphs. In: Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing, Congr. Numer, vol. 28, pp. 227\u2013239. Boca Raton (1980)"},{"key":"2865_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.endm.2017.10.013","volume":"62","author":"N Cohen","year":"2017","unstructured":"Cohen, N., Havet, F., Lochet, W., Lopes, R.: Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discrete Math. 62, 69\u201374 (2017)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"2865_CR8","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1002\/jgt.22360","volume":"89","author":"N Cohen","year":"2018","unstructured":"Cohen, N., Havet, F., Lochet, W., Nisse, N.: Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89(4), 439\u2013456 (2018)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2865_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113209","volume":"346","author":"M El Joubbeh","year":"2023","unstructured":"El Joubbeh, M.: Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number. Discrete Math. 346(1), 113209 (2023)","journal-title":"Discrete Math."},{"key":"2865_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P.: Graph theory and probability. Can. J. Math. 11, 34\u201338 (1959)","journal-title":"Can. J. Math."},{"key":"2865_CR11","unstructured":"Erd\u00f6s, P., Lov\u00e1z, L.: Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and finite sets, vol. II, Colloquia Mathematica Societatis Janos Bolyai, Vol. X, pp. 609-627. North-Holland, Amsterdam (1975)"},{"key":"2865_CR12","first-page":"115","volume-title":"On Directed Paths and Circuits, Theory of Graphs","author":"T Gallai","year":"1968","unstructured":"Gallai, T.: On Directed Paths and Circuits, Theory of Graphs, vol. 38, pp. 115\u2013118. Academic Press, New York (1968)"},{"key":"2865_CR13","first-page":"181","volume":"21","author":"T Gallai","year":"1960","unstructured":"Gallai, T., Milgram, A.N.: Verallgemeinerung eines graphentheoretischen Satzes vos R\u00e9dei. Acta Sci. Math. Szeged 21, 181\u2013186 (1960)","journal-title":"Acta Sci. Math. Szeged"},{"issue":"4","key":"2865_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1002\/jgt.22232","volume":"88","author":"R Kim","year":"2018","unstructured":"Kim, R., Kim, S.J., Ma, J., Park, B.: Cycles with two blocks in $$k$$-chromatic digraphs. J. Graph Theory 88(4), 592\u2013605 (2018)","journal-title":"J. Graph Theory"},{"issue":"5","key":"2865_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1051\/m2an\/1967010501291","volume":"1","author":"B Roy","year":"1967","unstructured":"Roy, B.: Nombre chromatique et plus longs chemins d\u2019un graphe. Rev. Fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle 1(5), 129\u2013132 (1967)","journal-title":"Rev. Fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02865-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02865-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02865-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:44Z","timestamp":1748319764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02865-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2865"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02865-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"26 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2024","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 authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"13"}}