On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings

Rémy Belmonte, Ignasi Sau. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. In Isolde Adler, Haiko Müller, editors, Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers. Volume 12301 of Lecture Notes in Computer Science, pages 67-79, Springer, 2020. [doi]

Abstract

Abstract is missing.