On the complexity of finding large odd induced subgraphs and odd colorings

DOI10.1007/978-3-030-60440-0_6OpenAlexW3165316009MaRDI QIDQ5918590

Rémy Belmonte, Ignasi Sau

Publication date: 21 December 2022

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-60440-0_6

zbMATH Keywords

parameterized complexityexponential time hypothesisodd subgraphrank-widthodd coloringsingle-exponential algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)