Decompositions of complete graphs into theta graphs with fewer than ten edges
| Contribuinte(s) |
R.G. Stanton J. Allston |
|---|---|
| Data(s) |
01/01/2003
|
| Resumo |
A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Utilitas Mathematica Publishing Inc |
| Palavras-Chave | #Mathematics, Applied #Statistics & Probability #C1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #780101 Mathematical sciences |
| Tipo |
Journal Article |
