Patel Viresh

Viresh Patel

Information about the author Viresh Patel will soon be added to the site.
Found 2 papers in total
Finding Shortest Paths Between Graph Colourings
2016
The k ‐colouring reconfiguration problem asks whether, for a given graph G ,...
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
2014
A k ‐colouring of a graph G =( V , E ) is a mapping c : V →{1,2,…,...
Papers per page: