-coloring of graphs with low average degree.

Alexandr V. Kostochka Kittikorn Nakprasit

Published in: Theor. Comput. Sci. (2005)

Keyphrases

average degree
phase transition
small world networks
random walk
network size
undirected graph
adjacency matrix
constraint satisfaction
small world
scale free
search algorithm
special case
np complete
numerical simulations
graph theory