On the complexity of finding large odd induced subgraphs and odd colorings (Q5918590)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of finding large odd induced subgraphs and odd colorings |
scientific article; zbMATH DE number 7636196
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding large odd induced subgraphs and odd colorings |
scientific article; zbMATH DE number 7636196 |
Statements
On the complexity of finding large odd induced subgraphs and odd colorings (English)
0 references
21 December 2022
0 references
odd subgraph
0 references
odd coloring
0 references
rank-width
0 references
parameterized complexity
0 references
single-exponential algorithm
0 references
exponential time hypothesis
0 references
