Coloring the square of graphs whose maximum average degree is less than 4.

Seog-Jin Kim Boram Park

Published in: Discret. Math. (2016)

Keyphrases

average degree
phase transition
random walk
network size
small world networks
undirected graph
constraint satisfaction
adjacency matrix
network structure
image segmentation
directed graph
small world