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. Algorithmica, 83(8):2351-2373, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.