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

Rémy Belmonte, Ignasi Sau (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-021-00830-X

access: closed

type: Journal Article

metadata version: 2021-07-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BelmonteS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BelmonteS21
Rémy Belmonte, Ignasi Sau:
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica 83(8): 2351-2373 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.