{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:44:53Z","timestamp":1767314693524,"version":"3.48.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_27","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:41:10Z","timestamp":1767314470000},"page":"377-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Structural Description of\u00a0Zykov and\u00a0Blanche Descartes Graphs"],"prefix":"10.1007","author":[{"given":"Malory","family":"Marin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Trotignon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Watrigant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"27_CR1","unstructured":"Bonnet, \u00c9., Bourneuf, R., Duron, J., Geniet, C., Thomass\u00e9, S., Trotignon, N.: A tamed family of triangle-free graphs with unbounded chromatic number (2023), arXiv:2304.04296"},{"key":"27_CR2","unstructured":"Burling, J.P.: On Coloring Problems of Families of Polytopes. University of Colorado at Boulder (1965)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: a Language-Theoretic Approach, vol.\u00a0138. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/jgt.22906","volume":"103","author":"J Davies","year":"2023","unstructured":"Davies, J.: Triangle-free graphs with large chromatic number and no induced wheel. J. Graph Theory 103(1), 112\u2013118 (2023)","journal-title":"J. Graph Theory"},{"issue":"21","key":"27_CR6","first-page":"24","volume":"9","author":"B Descartes","year":"1947","unstructured":"Descartes, B.: A three colour problem. Eureka 9(21), 24\u201325 (1947)","journal-title":"Eureka"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Descartes, B.: Solution to advanced problem no. 4526. Amer. Math. Monthly 61(352), 216 (1954)","DOI":"10.2307\/2307489"},{"issue":"5","key":"27_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0963548399004022","volume":"8","author":"AV Kostochka","year":"1999","unstructured":"Kostochka, A.V., Ne\u0161et\u0159il, J.: Properties of Descartes\u2019 construction of triangle-free graphs with high chromatic number. Comb. Probab. Comput. 8(5), 467\u2013472 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Mycielski, J.: Sur le coloriage des graphs. In: Colloquium Mathematicae, vol.\u00a03, pp. 161\u2013162 (1955)","DOI":"10.4064\/cm-3-2-161-162"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s00454-013-9534-9","volume":"50","author":"A Pawlik","year":"2013","unstructured":"Pawlik, A., Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free geometric intersection graphs with large chromatic number. Discrete Compututational Geom. 50(3), 714\u2013726 (2013)","journal-title":"Discrete Compututational Geom."},{"key":"27_CR11","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on the stable sets and coloring of graphs. Comment. Math. Univ. Carol. 15, 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carol."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"103686","DOI":"10.1016\/j.ejc.2023.103686","volume":"110","author":"P Pournajafi","year":"2023","unstructured":"Pournajafi, P., Trotignon, N.: Burling graphs revisited, part I: new characterizations. Eur. J. Comb. 110, 103686 (2023)","journal-title":"Eur. J. Comb."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"103849","DOI":"10.1016\/j.ejc.2023.103849","volume":"116","author":"P Pournajafi","year":"2024","unstructured":"Pournajafi, P., Trotignon, N.: Burling graphs revisited, part II: structure. Eur. J. Comb. 116, 103849 (2024)","journal-title":"Eur. J. Comb."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"103850","DOI":"10.1016\/j.ejc.2023.103850","volume":"116","author":"P Pournajafi","year":"2024","unstructured":"Pournajafi, P., Trotignon, N.: Burling graphs revisited, part III: applications to $$\\chi $$-boundedness. Eur. J. Comb. 116, 103850 (2024)","journal-title":"Eur. J. Comb."},{"key":"27_CR15","unstructured":"Rz\u0105\u017cewski, P., Walczak, B.: Polynomial-time recognition and maximum independent set in Burling graphs. arXiv preprint arXiv:2407.16666 (2024)"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.22601","volume":"95","author":"A Scott","year":"2020","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. J. Graph Theory 95(3), 473\u2013504 (2020)","journal-title":"J. Graph Theory"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s00453-015-0083-x","volume":"77","author":"S Thomass\u00e9","year":"2017","unstructured":"Thomass\u00e9, S., Trotignon, N., Vu\u0161kovi\u0107, K.: A polynomial turing-kernel for weighted independent set in bull-free graphs. Algorithmica 77, 619\u2013641 (2017)","journal-title":"Algorithmica"},{"issue":"2","key":"27_CR18","first-page":"163","volume":"66","author":"AA Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Matematicheskii sbornik 66(2), 163\u2013188 (1949)","journal-title":"Matematicheskii sbornik"}],"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-032-11835-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:41:11Z","timestamp":1767314471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","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":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}