arXiv (All)
open access
Complexity, Bounds, and Exact Algorithms for Rainbow $k$-Domination in Regular Graphs
A rainbow $k$-dominating function assigns the empty set or exactly one of the colors $\{1\},\{2\},\ldots,\{k\}$ to each vertex of a simple graph in such a way that every vertex receiving $\emptyset$ sees all $k$ colors in its neighborhood. This model has several facility-location interpretations whe
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
- Parameterized complexity of $k$-Coloring in graphs with no long induced paths#1069883
- A Brooks-like result for graph powers $#983875
- Nearly optimal packings of equally sized rainbow forests#1077280
- Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons#1109508
- Rainbow spanning configurations in uniformly coloured pseudorandom graphs#1062226
Record · ID 1215988
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