Login / Signup
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs.
Mike J. Grannell
Terry S. Griggs
Published in:
J. Comb. Theory, Ser. B (2008)
Keyphrases
</>
lower bound
random graphs
upper bound
graph matching
graph theory
graph theoretic
objective function
high dimensional
worst case
finite number
graph databases