Two vertex colorings of a graph are Kempe equivalent if they can be
tran...
In many Internet of Things (IoT) applications, data sensed by an IoT dev...
The cover time of a finite connected graph is the expected number of ste...
In this paper, we investigate the ratio of the numbers of odd and even c...
Given an edge-colored complete graph K_n on n vertices, a perfect
(respe...
We present Virtual Secure Platform (VSP), the first comprehensive platfo...
In this paper, we study the feedback game on 3-chromatic Eulerian
triang...
In this paper, we introduce a two-player impartial game on graphs, calle...