Rémy Belmonte, Ignasi Sau. On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica, 83(8):2351-2373, 2021. [doi]
@article{BelmonteS21,
title = {On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings},
author = {Rémy Belmonte and Ignasi Sau},
year = {2021},
doi = {10.1007/s00453-021-00830-x},
url = {https://doi.org/10.1007/s00453-021-00830-x},
researchr = {https://researchr.org/publication/BelmonteS21},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {83},
number = {8},
pages = {2351-2373},
}