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

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 22583
• Item Type
• Journal Item
• ISSN
• 0095-8956
• Keywords
• Steiner triple system; Latin square; Complete graph; Triangular embedding
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Depositing User
• Mike Grannell