arXiv (All)
open access
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
Recently, Böckenhauer, Frei, Unger, and Wehner (SIROCCO 2023) introduced a novel variant of the graph exploration problem in which a single memoryless agent must visit all nodes of an unknown, undirected, and connected graph before returning to its starting node. Unlike the standard model for mobile
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
- Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure#1083801
- Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure#919361
- A universal dichotomy for concentration in randomly colored graphs#924557
- A universal dichotomy for concentration in randomly colored graphs#920325
- Mutual visibility in Moore graphs and $(d,2)$-graphs with defect#665565
Record · ID 1131392
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