The Open UniversitySkip to content
 

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 (Digital Object Identifier) Link: http://doi.org/10.1016/j.jctb.2007.10.002
Google Scholar: Look up in Google Scholar
Item Type: Journal Article
ISSN: 0095-8956
Keywords: Steiner triple system; Latin square; Complete graph; Triangular embedding
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 22583
Depositing User: Mike Grannell
Date Deposited: 03 Aug 2010 10:29
Last Modified: 15 Jan 2016 14:03
URI: http://oro.open.ac.uk/id/eprint/22583
Share this page:

Altmetrics

Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk