A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs

Grannell, M. J. and Griggs, T. S. (2008). A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs. Journal of Combinatorial Theory, Series B, 98 pp. 637–650.

DOI: https://doi.org/10.1016/j.jctb.2007.10.002

Viewing alternatives

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

Recommendations