{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:21:44Z","timestamp":1743146504978,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"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_4","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"44-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Odd Chromatic Number of\u00a0Graph Classes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8043-5343","authenticated-orcid":false,"given":"R\u00e9my","family":"Belmonte","sequence":"first","affiliation":[]},{"given":"Ararat","family":"Harutyunyan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1023-6530","authenticated-orcid":false,"given":"Noleen","family":"K\u00f6hler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0864-9803","authenticated-orcid":false,"given":"Nikolaos","family":"Melissinos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.7151\/dmgt.2371","volume":"43","author":"A Aashtab","year":"2023","unstructured":"Aashtab, A., Akbari, S., Ghanbari, M., Shidani, A.: Vertex partitioning of graphs into odd induced subgraphs. Discuss. Math. Graph Theory 43(2), 385\u2013399 (2023)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"8","key":"4_CR2","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1007\/s00453-021-00830-x","volume":"83","author":"R Belmonte","year":"2021","unstructured":"Belmonte, R., Sau, I.: On the complexity of finding large odd induced subgraphs and odd colorings. Algorithmica 83(8), 2351\u20132373 (2021)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"4_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(92)00563-7","volume":"132","author":"Y Caro","year":"1994","unstructured":"Caro, Y.: On induced subgraphs with odd degrees. Discret. Math. 132(1\u20133), 23\u201328 (1994)","journal-title":"Discret. Math."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th Edn., vol. 173 of Graduate texts in mathematics. Springer, Cham (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2022.108534","volume":"406","author":"A Ferber","year":"2022","unstructured":"Ferber, A., Krivelevich, M.: Every graph contains a linearly sized induced subgraph with all degrees odd. Adv. Math. 406, 108534 (2022)","journal-title":"Adv. Math."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/3280824","volume":"15","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S., Zehavi, M.: Clique-width III: Hamiltonian cycle and the odd case of graph coloring. ACM Trans. Algorithms 15(1), 9:1-9:27 (2019)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ejc.2012.07.024","volume":"34","author":"R Ganian","year":"2013","unstructured":"Ganian, R., Hlinen\u00fd, P., Obdrz\u00e1lek, J.: A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb. 34(3), 680\u2013701 (2013)","journal-title":"Eur. J. Comb."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland (1993)","DOI":"10.1016\/B978-0-444-81504-0.50006-0"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1002\/jgt.22168","volume":"87","author":"M Petrusevski","year":"2018","unstructured":"Petrusevski, M.: Odd 4-edge-colorability of graphs. J. Graph Theory 87(4), 460\u2013474 (2018)","journal-title":"J. Graph Theory"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Petrusevski, M., Skrekovski, R.: Colorings with neighborhood parity condition (2021)","DOI":"10.1016\/j.dam.2022.07.018"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s003730170028","volume":"17","author":"AD Scott","year":"2001","unstructured":"Scott, A.D.: On induced subgraphs with all degrees odd. Graphs Comb. 17(3), 539\u2013553 (2001)","journal-title":"Graphs Comb."}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:43Z","timestamp":1695414583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_4","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"}}]}}