Counting the number of non-equivalent vertex colorings of a graph.

Alain Hertz Hadrien Mélot

Published in: Discret. Appl. Math. (2016)

Keyphrases

random graphs
database
directed graph
undirected graph
graph theoretic
case study
search algorithm
random walk
memory requirements
small number
connected components
bipartite graph
edge weights