Graphs with maximum average degree less than 114 are (1, 3)-choosable.

Yu-Chang Liang Tsai-Lien Wong Xuding Zhu

Published in: Discret. Math. (2018)

Keyphrases

average degree
phase transition
small world networks
random walk
network size
undirected graph
constraint satisfaction
adjacency matrix
numerical simulations
small world
image segmentation
markov chain
network structure
directed graph
scale free