{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:17:47Z","timestamp":1743113867610,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031433795"},{"type":"electronic","value":"9783031433801"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43380-1_27","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"376-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Minimum Number of\u00a0Arcs in\u00a04-Dicritical Oriented Graphs"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"Picasarri-Arrieta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9ment","family":"Rambaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"key":"27_CR1","unstructured":"Aboulker, P., Bellitto, T., Havet, F., Rambaud, C.: On the minimum number of arcs in $$k$$-dicritical oriented graphs. arXiv preprint arXiv:2207.01051 (2022)"},{"key":"27_CR2","unstructured":"Aboulker, P., Vermande, Q.: Various bounds on the minimum number of arcs in a $$ k $$-dicritical digraph. arXiv preprint arXiv:2208.02112 (2022)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Dirac, G.A.: A theorem of R. L. Brooks and a conjecture of H. Hadwiger. Proc. London Math. Soc. 3(1), 161\u2013195 (1957)","DOI":"10.1112\/plms\/s3-7.1.161"},{"issue":"214\u2013215","key":"27_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1515\/crll.1964.214-215.43","volume":"1964","author":"GA Dirac","year":"1964","unstructured":"Dirac, G.A.: On the structure of 5-and 6-chromatic abstract graphs. J. f\u00fcr die reine und angew. Math. (Crelles J.) 1964(214\u2013215), 43\u201352 (1964)","journal-title":"J. f\u00fcr die reine und angew. Math. (Crelles J.)"},{"key":"27_CR5","unstructured":"Gao, W., Postle, L.: On the minimal edge density of $${K}_4$$-free 6-critical graphs. arXiv:1811.02940 [math] (2018)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jctb.2022.04.004","volume":"156","author":"RJ Gould","year":"2022","unstructured":"Gould, R.J., Larsen, V., Postle, L.: Structure in sparse k-critical graphs. J. Comb. Theory Ser. B 156, 194\u2013222 (2022)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/100803870","volume":"25","author":"A Harutyunyan","year":"2011","unstructured":"Harutyunyan, A., Mohar, B.: Gallai\u2019s theorem for list coloring of digraphs. SIAM J. Discret. Math. 25(1), 170\u2013180 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Havet, F., Picasarri-Arrieta, L., Rambaud, C.: On the minimum number of arcs in $$4 $$-dicritical oriented graphs. arXiv preprint arXiv:2306.10784 (2023)","DOI":"10.1007\/978-3-031-43380-1_27"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s004930070005","volume":"20","author":"A Kostochka","year":"2000","unstructured":"Kostochka, A., Stiebitz, M.: On the number of edges in colour-critical graphs and hypergraphs. Combinatorica 20(4), 521\u2013530 (2000)","journal-title":"Combinatorica"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00373-020-02147-y","volume":"36","author":"A Kostochka","year":"2020","unstructured":"Kostochka, A., Stiebitz, M.: The minimum number of edges in 4-critical digraphs of given order. Graphs Comb. 36(3), 703\u2013718 (2020)","journal-title":"Graphs Comb."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jctb.2014.05.002","volume":"109","author":"A Kostochka","year":"2014","unstructured":"Kostochka, A., Yancey, M.: Ore\u2019s conjecture on color-critical graphs is almost true. J. Comb. Theory, Ser. B 109, 73\u2013101 (2014)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1007\/s00493-017-3068-3","volume":"38","author":"A Kostochka","year":"2018","unstructured":"Kostochka, A., Yancey, M.: A Brooks-type result for sparse critical graphs. Combinatorica 38(4), 887\u2013934 (2018)","journal-title":"Combinatorica"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Postle, L.: On the minimum number of edges in triangle-free 5-critical graphs. Eur. J. Comb. 66, 264\u2013280 (2017). selected papers of EuroComb15","DOI":"10.1016\/j.ejc.2017.06.026"}],"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-43380-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T11:58:07Z","timestamp":1703246287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 September 2023","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":"Fribourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.unifr.ch\/wg2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}