arXiv (All)
open access
Pair-Defensive Silver Colourings of Hypercubes
A silver colouring is a proper colouring in which every colour appears in the closed neighbourhood of each vertex of a prescribed independent set. This local condition suffices when vertices are tested one at a time. We study a stronger requirement for simultaneous testing: whenever one or two verti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Vertex-Coloring Edge-Weighting: Kernelization and Generalization#1064263
- KKM theorems and discrete geometry beyond matroids#984178
- Colour constancy#658849
- Multicolor Ramsey and list Ramsey numbers for star-like trees#973959
- The forced colouring function of a graph#1123499
Record · ID 1143960
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive