Six colors always suffice for memoryless recolorable graph exploration, improving on the previous eight; five suffice for triangle-free and for phi-free graphs.
Searching for a black hole in arbitrary networks: Optimal mobile agents protocols.Distributed Computing, 19:1–99999, 2006
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
Six colors always suffice for memoryless recolorable graph exploration, improving on the previous eight; five suffice for triangle-free and for phi-free graphs.