2 citations · 4 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2022
Cover time of graphs with bounded genus
Naoki Matsumoto, Yuuki Takai
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all vertices of the graph. It is known that the cov…
cs.DM2020
Feedback game on -chromatic Eulerian triangulations of surfaces
Akihiro Higashitani, Kazuki Kurimoto, Naoki Matsumoto
In this paper, we study the feedback game on -chromatic Eulerian triangulations of surfaces. We prove that the winner of the game on every -chromatic Eulerian triangulation o…