On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338)
From MaRDI portal
scientific article; zbMATH DE number 7374875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding large odd induced subgraphs and odd colorings |
scientific article; zbMATH DE number 7374875 |
Statements
On the complexity of finding large odd induced subgraphs and odd colorings (English)
0 references
26 July 2021
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
0 references
0 references
