Login / Signup
Maximum pebbling number of graphs of diameter three.
Boris Bukh
Published in:
J. Graph Theory (2006)
Keyphrases
</>
maximum number
small number
computational complexity
orders of magnitude
knowledge base
undirected graph