arXiv (All)
open access
A note on efficient k-limited broadcast domination in graphs
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
- A note on efficient k-limited broadcast domination in graphs#656873
- On $k$-limited domination: complexity and Sierpiński graphs#1156855
- On $k$-limited domination: complexity and Cartesian products#1156397
- Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set#1012810
- More on Rainbow Cliques in Edge-Colored Graphs#1122876
Record · ID 659009
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