Packing lambda-fold complete multipartite graphs with 4-cycles
| Contribuinte(s) |
Jin Akiyama Mikio Kano |
|---|---|
| Data(s) |
01/01/2005
|
| Resumo |
A maximum packing of any lambda-fold complete multipartite graph (where there are lambda edges between any two vertices in different parts) with edge-disjoint 4- cycles is obtained and the size of each minimum leave is given. Moreover, when lambda =2, maximum 4-cycle packings are found for all possible leaves. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Springer-Verlag |
| Palavras-Chave | #Mathematics #Cycle Decompositions #Length #C1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #780101 Mathematical sciences |
| Tipo |
Journal Article |
