{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T22:01:20Z","timestamp":1772661680876,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_6","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:27Z","timestamp":1737497427000},"page":"79-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Oriented Trees in\u00a0$$O(k \\sqrt{k})$$-Chromatic Digraphs, a\u00a0Subquadratic Bound for\u00a0Burr\u2019s Conjecture"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7130-4990","authenticated-orcid":false,"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3228-9622","authenticated-orcid":false,"given":"Daniel","family":"Gon\u00e7alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8108-4036","authenticated-orcid":false,"given":"Amadeus","family":"Reinald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"8","key":"6_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., Linhares Sales, C., Reed, B., Thomass\u00e9, S.: Oriented trees in digraphs. Discret. Math. 313(8), 967\u2013974 (2013). https:\/\/doi.org\/10.1016\/j.disc.2013.01.011","journal-title":"Discret. Math."},{"issue":"4","key":"6_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. Theo. Ser. B 97(4), 620\u2013626 (2007). https:\/\/doi.org\/10.1016\/j.jctb.2006.10.001","journal-title":"J. Comb. Theo. Ser. B"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. Springer Monographs in Mathematics. Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84800-998-1","DOI":"10.1007\/978-1-84800-998-1"},{"key":"6_CR4","unstructured":"Burr, S.A.: Subtrees of directed graphs and hypergraphs. In: Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 28, pp. 227\u2013239 (1980)"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"El Joubbeh, M.: On three blocks paths p(k, l, r). Discret. Appl. Math. 322, 237\u2013239 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.08.021, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X22003250","DOI":"10.1016\/j.dam.2022.08.021"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.dam.2023.09.025","volume":"342","author":"M El Joubbeh","year":"2024","unstructured":"El Joubbeh, M., Ghazal, S.: Existence of paths with t blocks in k (t)-chromatic digraph. Discret. Appl. Math. 342, 381\u2013384 (2024)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.disc.2004.03.013","volume":"287","author":"A El Sahili","year":"2004","unstructured":"El Sahili, A.: Paths with two blocks in k-chromatic digraphs. Discret. Math. 287(1), 151\u2013153 (2004). https:\/\/doi.org\/10.1016\/j.disc.2004.03.013","journal-title":"Discret. Math."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jctb.2004.04.002","volume":"92","author":"A El Sahili","year":"2004","unstructured":"El Sahili, A.: Trees in tournaments. J. Comb. Theo. Ser. B 92(1), 183\u2013187 (2004). https:\/\/doi.org\/10.1016\/j.jctb.2004.04.002","journal-title":"J. Comb. Theo. Ser. B"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Can. J. Math. 11, 34\u201338 (1959). https:\/\/doi.org\/10.4153\/CJM-1959-003-9","journal-title":"Can. J. Math."},{"key":"6_CR10","unstructured":"Gallai, T.: On directed paths and circuits. In: Proceedings of the Colloquim held at Tihany, pp. 115\u2013118 (1966)"},{"key":"6_CR11","unstructured":"Gy\u00e1rf\u00e1s, A.: On Ramsey covering-numbers. Infinite Finite Sets 2, 801\u2013816 (1975). https:\/\/users.renyi.hu\/~gyarfas\/Cikkek\/05_Gyarfas_OnRamseyCoveringNumbers.pdf"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Hasse, M.: Zur algebraischen begr\u00fcndung der graphentheorie. i. Mathematische Nachrichten 28(5\u20136), 275\u2013290 (1965)","DOI":"10.1002\/mana.19650280503"},{"issue":"1\u20133","key":"6_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0012-365X(00)00463-5","volume":"243","author":"F Havet","year":"2002","unstructured":"Havet, F.: Trees in tournaments. Discrete Math. 243(1\u20133), 121\u2013134 (2002)","journal-title":"Discrete Math."},{"key":"6_CR14","unstructured":"Havet, F.: Orientations and colouring of graphs (2013). https:\/\/oc.g-scop.grenoble-inp.fr\/conf\/sgt2013\/oleron.pdf"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"K\u00fchn, D., Mycroft, R., Osthus, D.: A proof of sumner\u2019s universal tournament conjecture for large tournaments. Proc. Lond. Math. Soc. 102(4), 731\u2013766 (2011). https:\/\/doi.org\/10.1112\/plms\/pdq035, https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/plms\/pdq035","DOI":"10.1112\/plms\/pdq035"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Naia, T.: Trees contained in every orientation of a graph. Electron. J. Combinatorics 29(2), P2.26 (2022). https:\/\/doi.org\/10.37236\/10487","DOI":"10.37236\/10487"},{"key":"6_CR17","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Priceton University Press (1944)"},{"issue":"5","key":"6_CR18","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. Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle 1(5), 129\u2013132 (1967)","journal-title":"Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle"},{"key":"6_CR19","unstructured":"Sumner, D.: Subtrees of a graph and the chromatic number. In: The Theory and Applications of Graphs: Fourth International Conference, May 6\u20139, 1980, Western Michigan University, Kalamazoo, Michigan. Wiley, New York (1981)"},{"key":"6_CR20","unstructured":"Vitaver, L.: Determination of minimal coloring of vertices of a graph by means of boolean powers of the incidence matrix. Doklady Akademii Nauk 147, 4(4), 758\u2013759 (1962)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:39Z","timestamp":1737497439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}