Complexity of computing the anti-Ramsey numbers for paths (Q6985811)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8038206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of computing the anti-Ramsey numbers for paths |
scientific article; zbMATH DE number 8038206 |
Statements
Complexity of computing the anti-Ramsey numbers for paths (English)
0 references
12 May 2025
0 references
hardness of approximation
0 references
ETH
0 references
exact algorithm
0 references
NP-hardness
0 references
graph coloring
0 references
