Login / Signup
A Better Lower Bound on Average Degree of 4-List-Critical Graphs.
Landon Rabern
Published in:
Electron. J. Comb. (2016)
Keyphrases
</>
average degree
lower bound
phase transition
small world networks
upper bound
network size
random walk
undirected graph
objective function
optimal solution
np hard
small world
complex networks
directed graph
worst case
learning algorithm
constraint satisfaction
numerical simulations
markov chain