{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:11Z","timestamp":1780783151272,"version":"3.54.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","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-27732-9_32","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:58Z","timestamp":1780780498000},"page":"456-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["(Even Hole, Triangle)-Free Graphs Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5777-2324","authenticated-orcid":false,"given":"Beatriz","family":"Martins","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1978-0687","authenticated-orcid":false,"given":"Nicolas","family":"Trotignon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Cameron, K., da Silva, M.V.G., Huang, S., Vu\u0161kovi\u0107, K.: Structure and algorithms for (cap, even hole)-free graphs. Discrete Math. 341(2), 463\u2013473 (2018)","DOI":"10.1016\/j.disc.2017.09.013"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1002\/1097-0118(200007)34:3<204::AID-JGT2>3.0.CO;2-P","volume":"34","author":"M Conforti","year":"2000","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Triangle-free graphs that are signable without even holes. J. Graph Theor. 34(3), 204\u2013220 (2000)","journal-title":"J. Graph Theor."},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01196132","volume":"17","author":"M Conforti","year":"1997","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Universally signable graphs. Combinatorica 17(1), 67\u201377 (1997)","journal-title":"Combinatorica"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1002\/jgt.10006","volume":"39","author":"M Conforti","year":"2002","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Even-hole-free graphs part I: decomposition theorem. J. Graph Theor. 39(1), 6\u201349 (2002)","journal-title":"J. Graph Theor."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/jgt.10045","volume":"40","author":"M Conforti","year":"2002","unstructured":"Conforti, M., Cornu\u00e9jols, G., Kapoor, A., Vu\u0161kovi\u0107, K.: Even-hole-free graphs Part II: recognition algorithm. J. Graph Theor. 40, 238\u2013266 (2002)","journal-title":"J. Graph Theor."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"da Silva, M.V.G., Vu\u0161kovi\u0107, K.: Decomposition of even-hole-free graphs with star cutsets and 2-joins. J. Comb. Theor. Ser. B 103(1), 144\u2013183 (2013)","DOI":"10.1016\/j.jctb.2012.10.001"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Lai, K.Y., Lu, H.I, Thorup, M.: Three-in-a-tree in near linear time. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J., (eds. ) Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22\u201326, 2020, pp. 1279\u20131292. ACM (2020)","DOI":"10.1145\/3357713.3384235"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Sintiari, N.L.D., Thomass\u00e9, S., Trotignon, N.: (Theta, triangle)-free and (even hole, K$$_{4}$$)-free graphs. part2: bounds on treewidth. J. Graph Theor. 97(4), 624\u2013641 (2021)","DOI":"10.1002\/jgt.22675"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Radovanovi\u0107, M., Vu\u0161kovi\u0107, K.: A class of three-colorable triangle-free graphs. J. Graph Theor. 72(4), 430\u2013439 (2013)","DOI":"10.1002\/jgt.21651"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Sintiari, N.L.D., Trotignon, N.: (Theta, triangle)-free and (even hole, K$$_{4}$$)-free graphs - part 1: layered wheels. J. Graph Theor. 97(4), 475\u2013509 (2021). arXiv:1906.10998","DOI":"10.1002\/jgt.22666"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Vu\u0161kovi\u0107, K.: Even-hole-free graphs: a survey. Appl. Anal. Discrete Math. 10(2), 219\u2013240 (2010)","DOI":"10.2298\/AADM100812027V"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:59Z","timestamp":1780780499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_32","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":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}