Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings (Q6764004)
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: [[]] |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings |
scientific article from arXiv |
Statements
cs.DM
0 references
2025
0 references
