research · Working draft
Questions after Hierholzer
Thinking about the Chinese postman problem and what a careful next question might look like.
The Chinese postman problem is a natural place for my attention to go next: find a shortest closed walk that covers every edge, allowing repetitions where an Euler tour cannot exist.
The question I want to investigate is what happens when working memory is scarce. Which parts of an existing route-inspection algorithm really need edge-sized storage? Can a compact representation help without losing the time bound?
This is a research direction, not a claim of a new open problem or result. My next step is to separate the graph variants, read the relevant algorithms, and identify precisely which time–space tradeoffs remain unresolved.