arXiv (OAI)open access
Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
discrete mathematics, computational complexity, combinatorics
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 183190
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.