Decomposing complete tripartite graphs into cycles of lengths 3 and 4
| Contribuinte(s) |
Peter L. Hammer |
|---|---|
| Data(s) |
28/02/1999
|
| Resumo |
Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K-r,K-s,K-t into exactly alpha 3-cycles and beta 4-cycles. (C) 1999 Elsevier Science B.V. All rights reserved. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Elsevier Science |
| Palavras-Chave | #Mathematics #Graph Decomposition #Complete Tripartite Graph #Cycle System #C1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #780101 Mathematical sciences |
| Tipo |
Journal Article |
