Login / Signup
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
Marthe Bonamy
Benjamin Lévêque
Alexandre Pinlou
Published in:
CoRR (2013)
Keyphrases
</>
average degree
network topology
neural network
search space
random walk
graph theory
weighted graph
network size
small world networks