Factorizations of and by powers of complete graphs
| Contribuinte(s) |
P. L. Hammer |
|---|---|
| Data(s) |
01/01/2002
|
| Resumo |
Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary and sufficient conditions for the existence of a K-k(r)-factorization of K-pn(s), where p is prime and k > 1, n, r and s are positive integers. (C) 2002 Elsevier Science B.V. All rights reserved. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Elsevier Science B V, North Holland |
| Palavras-Chave | #Mathematics #Graph Factorization #Cartesian Product #Affine Geometries #Generalized Cubes #Snakes #C1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #780101 Mathematical sciences |
| Tipo |
Journal Article |
